##############################################################################
##############################################################################
###
### Running command:
###
###   /home/biocbuild/R/R/bin/R CMD INSTALL RBGL
###
##############################################################################
##############################################################################


* installing to library ‘/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library’
* installing *source* package ‘RBGL’ ...
** using staged installation
** libs
using C++ compiler: ‘aarch64-unknown-linux-gnu-g++ (GCC) 14.2.0’
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c bbc.cpp -o bbc.o
In file included from bbc.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
                 from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
  107 |   template <> struct SignedInteger<long> {};
      |                      ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:249:47:   required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  249 |                     make_iterator_property_map(colors.begin(), vertex_index));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:412:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  412 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  413 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  414 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36:   required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  248 |                 breadth_first_visit(g, s, Q, visitor,
      |                 ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  249 |                     make_iterator_property_map(colors.begin(), vertex_index));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:412:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  412 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  413 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  414 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36:   required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  248 |                 breadth_first_visit(g, s, Q, visitor,
      |                 ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  249 |                     make_iterator_property_map(colors.begin(), vertex_index));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:412:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  412 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  413 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  414 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:13,
                 from bbc.cpp:37:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36:   required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  248 |                 breadth_first_visit(g, s, Q, visitor,
      |                 ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  249 |                     make_iterator_property_map(colors.begin(), vertex_index));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:412:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  412 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  413 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  414 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36:   required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  248 |                 breadth_first_visit(g, s, Q, visitor,
      |                 ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  249 |                     make_iterator_property_map(colors.begin(), vertex_index));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36:   required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  248 |                 breadth_first_visit(g, s, Q, visitor,
      |                 ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  249 |                     make_iterator_property_map(colors.begin(), vertex_index));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36:   required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  248 |                 breadth_first_visit(g, s, Q, visitor,
      |                 ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  249 |                     make_iterator_property_map(colors.begin(), vertex_index));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36:   required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  248 |                 breadth_first_visit(g, s, Q, visitor,
      |                 ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  249 |                     make_iterator_property_map(colors.begin(), vertex_index));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36:   required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  248 |                 breadth_first_visit(g, s, Q, visitor,
      |                 ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  249 |                     make_iterator_property_map(colors.begin(), vertex_index));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46:   required from ‘static boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::type boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>]’
  245 |             return make_iterator_property_map(array_holder.get(), index);
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33:   required from ‘static boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::type boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>]’
  273 |             return helper::build(g, index, array_holder);
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >]’
  377 |         = IndexInHeapMapHelper::build(g, index_map, index_in_heap_map_holder);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<long unsigned int*>::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  500 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  501 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  502 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  503 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  504 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  505 |                 vertex_index);
      |                 ~~~~~~~~~~~~~              
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  531 |                 brandes_betweenness_centrality_dispatch2(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  532 |                     g, centrality, edge_centrality_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
  131 |         brandes_betweenness_centrality(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  132 |             edge_centrality_map(edge_centrality)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  133 |                 .vertex_index_map(vertex_index));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38:   required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
  150 |     betweenness_centrality_clustering(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  151 |         g, done, edge_centrality, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36:   required from here
  149 |                 betweenness_centrality_clustering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  150 |                         clustering_threshold(threshold, g, normalize),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  151 |                         get(edge_centrality, g));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
  349 |                 shortest_paths(g, *s, ordered_vertices, incoming, distance,
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  350 |                     path_count, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  434 |     detail::graph::brandes_betweenness_centrality_impl(g, centrality,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  435 |         edge_centrality_map, incoming, distance, dependency, path_count,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  436 |         vertex_index, shortest_paths);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43:   required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
  468 |             brandes_betweenness_centrality(g, centrality, edge_centrality_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  469 |                 make_iterator_property_map(incoming.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  470 |                 make_iterator_property_map(distance.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  471 |                 make_iterator_property_map(dependency.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  472 |                 make_iterator_property_map(path_count.begin(), vertex_index),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  473 |                 vertex_index, weight_map);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57:   required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
  517 |                 brandes_betweenness_centrality_dispatch2(g, centrality,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
  518 |                     edge_centrality_map, weight_map, vertex_index);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71:   required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  558 |     detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  559 |         choose_param(
      |         ~~~~~~~~~~~~~                                                  
  560 |             get_param(params, vertex_centrality), dummy_property_map()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  561 |         choose_param(get_param(params, edge_centrality), dummy_property_map()),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  562 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  563 |         get_param(params, edge_weight));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                                
bbc.cpp:67:33:   required from here
   67 |                 brandes_betweenness_centrality(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   68 |                         centrality_map(get(vertex_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         edge_centrality_map(get(edge_centrality, g)).
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   70 |                         weight_map(get(edge_weight, g)));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c cliques.cpp -o cliques.o
In file included from cliques.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c clusteringCoef.cpp -o clusteringCoef.o
In file included from clusteringCoef.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c dominatorTree.cpp -o dominatorTree.o
In file included from dominatorTree.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
                 from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:123:5:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:15: note: in a call to non-static member function ‘boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >::~BidirectionalGraphConcept()’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: note: in expansion of macro ‘BOOST_concept’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  351 |     TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:123:5:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:123:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  123 |     BOOST_CONCEPT_USAGE(BidirectionalGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
  107 |   template <> struct SignedInteger<long> {};
      |                      ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:126:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:126:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::bidirectional_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:15,
                 from dominatorTree.cpp:2:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept<boost::default_color_type>::~ColorValueConcept()’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’
  502 | BOOST_concept(ColorValue, (C))
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40:   required from here
   44 |              make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:126:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::bidirectional_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue<C>::~ColorValue() [with C = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  505 |     BOOST_CONCEPT_USAGE(ColorValue)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<void*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<void*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48:   required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
   91 |         , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
      |                      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9:   required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  254 |         visitor(g, entry, indexMap, domTreePredMap);
      |         ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  317 |     lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |         parentMap, verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  309 |     depth_first_visit(g, entry,
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~
  310 |         make_dfs_visitor(
      |         ~~~~~~~~~~~~~~~~~
  311 |             make_pair(record_predecessors(parentMap, on_tree_edge()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  312 |                 detail::stamp_times_with_vertex_vector(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                     dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |         make_iterator_property_map(colors.begin(), indexMap));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35:   required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
  360 |     lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         verticesByDFNum, domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36:   required from here
   46 |         lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c edmonds_optimum_branching.cpp -o edmonds_optimum_branching.o
In file included from edmonds_optimum_branching.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from edmonds_optimum_branching.hpp:94,
                 from edmonds_optimum_branching.cpp:3:
edmonds_optimum_branching_impl.hpp: In function ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator)’:
edmonds_optimum_branching_impl.hpp:520:71: warning: typedef ‘EdgeIter’ locally defined but not used [-Wunused-local-typedefs]
  520 |     typedef typename graph_traits<TEdgeListGraph>::edge_iterator      EdgeIter;
      |                                                                       ^~~~~~~~
edmonds_optimum_branching_impl.hpp:521:71: warning: typedef ‘weight_t’ locally defined but not used [-Wunused-local-typedefs]
  521 |     typedef typename property_traits<TWeightMap>::value_type          weight_t;
      |                                                                       ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
                 from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >::~EdgeListGraphConcept()’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:524:70:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  524 |     function_requires< ReadablePropertyMapConcept<TWeightMap, Edge> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:525:77:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  525 |     function_requires< ReadablePropertyMapConcept<TVertexIndexMap, Vertex> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIteratorConcept<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  526 |     function_requires< InputIteratorConcept<TInputIterator> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIteratorConcept<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  526 |     function_requires< InputIteratorConcept<TInputIterator> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIteratorConcept<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  526 |     function_requires< InputIteratorConcept<TInputIterator> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIteratorConcept<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  526 |     function_requires< InputIteratorConcept<TInputIterator> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:17: note: in a call to non-static member function ‘boost::InputIteratorConcept<long unsigned int*>::~InputIteratorConcept()’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: note: in expansion of macro ‘BOOST_concept’
  502 |   BOOST_concept(InputIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept<std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:527:70:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  527 |     function_requires< OutputIteratorConcept<TOutputIterator, Edge> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5:   required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept<std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:527:70:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  527 |     function_requires< OutputIteratorConcept<TOutputIterator, Edge> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept<std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:527:70:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  527 |     function_requires< OutputIteratorConcept<TOutputIterator, Edge> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >::~OutputIteratorConcept()’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:524:70:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  524 |     function_requires< ReadablePropertyMapConcept<TWeightMap, Edge> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:524:70:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  524 |     function_requires< ReadablePropertyMapConcept<TWeightMap, Edge> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:525:77:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  525 |     function_requires< ReadablePropertyMapConcept<TVertexIndexMap, Vertex> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:525:77:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  525 |     function_requires< ReadablePropertyMapConcept<TVertexIndexMap, Vertex> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIteratorConcept<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  526 |     function_requires< InputIteratorConcept<TInputIterator> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIteratorConcept<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  526 |     function_requires< InputIteratorConcept<TInputIterator> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIteratorConcept<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  526 |     function_requires< InputIteratorConcept<TInputIterator> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept<std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:527:70:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  527 |     function_requires< OutputIteratorConcept<TOutputIterator, Edge> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5:   required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept<std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:527:70:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  527 |     function_requires< OutputIteratorConcept<TOutputIterator, Edge> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator<TT, ValueT>::~OutputIterator() [with TT = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >; ValueT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  529 |     BOOST_CONCEPT_USAGE(OutputIterator) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:524:70:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  524 |     function_requires< ReadablePropertyMapConcept<TWeightMap, Edge> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:525:77:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  525 |     function_requires< ReadablePropertyMapConcept<TVertexIndexMap, Vertex> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIteratorConcept<long unsigned int*>]’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  526 |     function_requires< InputIteratorConcept<TInputIterator> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
  107 |   template <> struct SignedInteger<long> {};
      |                      ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIteratorConcept<long unsigned int*>]’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  526 |     function_requires< InputIteratorConcept<TInputIterator> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIteratorConcept<long unsigned int*>]’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  526 |     function_requires< InputIteratorConcept<TInputIterator> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIteratorConcept<long unsigned int*>]’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  526 |     function_requires< InputIteratorConcept<TInputIterator> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7:   required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62:   required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
  523 |     function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47:   required from here
   36 |         edmonds_optimum_branching<true, false, false>(g,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
   37 |                                   vertex_indices,
      |                                   ~~~~~~~~~~~~~~~     
   38 |                                   weights,
      |                                   ~~~~~~~~            
   39 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   40 |                                   static_cast<Vertex *>(0),
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~
   41 |                                   std::back_inserter(branching));
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c hcs.cpp -o hcs.o
In file included from hcs.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
                 from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:20,
                 from mincut.hpp:4,
                 from hcs.cpp:2:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:39:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
  107 |   template <> struct SignedInteger<long> {};
      |                      ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31:   required from here
  299 |                        min_cut(g, std::back_inserter(s_vec),
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  300 |                                std::back_inserter(vs_vec) );
      |                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/set:62,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:18:
In member function ‘std::pair<std::_Rb_tree_iterator<_Val>, bool> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_unique(_Arg&&) [with _Arg = const long unsigned int&; _Key = long unsigned int; _Val = long unsigned int; _KeyOfValue = std::_Identity<long unsigned int>; _Compare = std::less<long unsigned int>; _Alloc = std::allocator<long unsigned int>]’,
    inlined from ‘std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = long unsigned int; _Compare = std::less<long unsigned int>; _Alloc = std::allocator<long unsigned int>]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_set.h:514:25,
    inlined from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’ at mincut.hpp:67:13:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_tree.h:2167:35: warning: ‘p’ may be used uninitialized [-Wmaybe-uninitialized]
 2167 |         = _M_get_insert_unique_pos(_KeyOfValue()(__v));
      |           ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp: In function ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:34:44: note: ‘p’ was declared here
   34 |         typename Traits::vertex_descriptor p;
      |                                            ^
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/string:51,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/locale_classes.h:40,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/ios_base.h:41,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/ios:44,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/ostream:40,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/iostream:41,
                 from RBGL.hpp:7:
In static member function ‘static _Up* std::__copy_move<_IsMove, true, std::random_access_iterator_tag>::__copy_m(_Tp*, _Tp*, _Up*) [with _Tp = const int; _Up = int; bool _IsMove = false]’,
    inlined from ‘_OI std::__copy_move_a2(_II, _II, _OI) [with bool _IsMove = false; _II = const int*; _OI = int*]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_algobase.h:521:30,
    inlined from ‘_OI std::__copy_move_a1(_II, _II, _OI) [with bool _IsMove = false; _II = const int*; _OI = int*]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_algobase.h:548:42,
    inlined from ‘_OI std::__copy_move_a(_II, _II, _OI) [with bool _IsMove = false; _II = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _OI = int*]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_algobase.h:555:31,
    inlined from ‘_OI std::copy(_II, _II, _OI) [with _II = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _OI = int*]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_algobase.h:651:7,
    inlined from ‘static _ForwardIterator std::__uninitialized_copy<true>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const int*, std::vector<int> >; _ForwardIterator = int*]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_uninitialized.h:147:27,
    inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _ForwardIterator = int*]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_uninitialized.h:185:15,
    inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _ForwardIterator = int*; _Tp = int]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_uninitialized.h:373:37,
    inlined from ‘std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = int; _Alloc = std::allocator<int>]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_vector.h:606:31,
    inlined from ‘void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = std::vector<int>; _Args = {const std::vector<int, std::allocator<int> >&}; _Tp = std::vector<int>]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/new_allocator.h:191:4,
    inlined from ‘static void std::allocator_traits<std::allocator<_CharT> >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = std::vector<int>; _Args = {const std::vector<int, std::allocator<int> >&}; _Tp = std::vector<int>]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/alloc_traits.h:534:17,
    inlined from ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::vector<int>; _Alloc = std::allocator<std::vector<int> >]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_vector.h:1288:30,
    inlined from ‘void HCS_internal(const Graph_ud&, V_Label&, ClusterResult&)’ at hcs.cpp:310:27:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_algobase.h:452:30: warning: ‘void* __builtin_memmove(void*, const void*, long unsigned int)’ forming offset 4 is out of the bounds [0, 4] [-Warray-bounds=]
  452 |             __builtin_memmove(__result, __first, sizeof(_Tp) * _Num);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c incrConnComp.cpp -o incrConnComp.o
In file included from incrConnComp.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from incrConnComp.cpp:2:
incrConnComp.cpp: In function ‘SEXPREC* BGL_incr_comp_internal(SEXP, SEXP, SEXP, E_IC_METHOD)’:
incrConnComp.cpp:74:39: warning: unused variable ‘child_index’ [-Wunused-variable]
   74 |             BOOST_FOREACH(VertexIndex child_index, components[current_index]) {
      |                                       ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/foreach.hpp:1114:14: note: in definition of macro ‘BOOST_FOREACH’
 1114 |         for (VAR = BOOST_FOREACH_DEREF(COL); !BOOST_FOREACH_ID(_foreach_continue); BOOST_FOREACH_ID(_foreach_continue) = true)
      |              ^~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c interfaces.cpp -o interfaces.o
In file included from interfaces.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_tsort_D(SEXP, SEXP, SEXP)’:
interfaces.cpp:81:17: warning: catching polymorphic type ‘struct boost::not_a_dag’ by value [-Wcatch-value=]
   81 |         catch ( not_a_dag )
      |                 ^~~~~~~~~
interfaces.cpp:57:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
   57 |         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
      |                                                            ^~~~
interfaces.cpp:61:62: warning: typedef ‘Color’ locally defined but not used [-Wunused-local-typedefs]
   61 |         typedef property_map<Graph_dd, vertex_color_t>::type Color;
      |                                                              ^~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_bfs_D(SEXP, SEXP, SEXP, SEXP, SEXP)’:
interfaces.cpp:98:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
   98 |         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
      |                                                            ^~~~
interfaces.cpp:99:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
   99 |         typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
      |                                                              ^~~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_dfs_D(SEXP, SEXP, SEXP, SEXP)’:
interfaces.cpp:142:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
  142 |         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
      |                                                            ^~~~
interfaces.cpp:143:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
  143 |         typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
      |                                                              ^~~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_connected_components_U(SEXP, SEXP, SEXP, SEXP)’:
interfaces.cpp:198:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
  198 |         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
      |                                                            ^~~~
interfaces.cpp:199:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
  199 |         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
      |                                                              ^~~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_strong_components_D(SEXP, SEXP, SEXP, SEXP)’:
interfaces.cpp:225:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
  225 |         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
      |                                                            ^~~~
interfaces.cpp:226:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
  226 |         typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
      |                                                              ^~~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_biconnected_components_U(SEXP, SEXP, SEXP, SEXP)’:
interfaces.cpp:252:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
  252 |         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
      |                                                            ^~~~
interfaces.cpp:253:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
  253 |         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
      |                                                              ^~~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_articulation_points_U(SEXP, SEXP, SEXP, SEXP)’:
interfaces.cpp:295:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
  295 |         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
      |                                                            ^~~~
interfaces.cpp: In function ‘SEXPREC* BGL_edge_connectivity_U(SEXP, SEXP, SEXP, SEXP)’:
interfaces.cpp:320:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
  320 |         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
      |                                                              ^~~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_sequential_vertex_coloring(SEXP, SEXP, SEXP)’:
interfaces.cpp:360:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
  360 |         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
      |                                                            ^~~~
interfaces.cpp:361:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
  361 |         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
      |                                                              ^~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<int*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:76:5:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = int*; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<int*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<int*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:76:5:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = int*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<int*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<int*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:76:5:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
                 from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<int*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<int*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:76:5:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<dfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from interfaces.cpp:3:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = dfs_time_visitor<long unsigned int*>; Graph = R_adjacency_list<boost::directedS, double>]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<dfs_time_visitor<long unsigned int*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<dfs_time_visitor<long unsigned int*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<dfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<dfs_time_visitor<long unsigned int*> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = dfs_time_visitor<long unsigned int*>; Graph = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<dfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<dfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<dfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<dfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept<boost::default_color_type>::~ColorValueConcept()’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’
  502 | BOOST_concept(ColorValue, (C))
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::components_recorder<int*>; Graph = R_adjacency_list<boost::undirectedS, double>]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from interfaces.cpp:4:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
  107 |   template <> struct SignedInteger<long> {};
      |                      ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >, R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:75:21:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >]’
   75 |     topological_sort(
      |     ~~~~~~~~~~~~~~~~^
   76 |         g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:71:29:   required from here
   71 |             topological_sort(g, std::front_inserter(tsord));
      |             ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >; Graph = R_adjacency_list<boost::directedS, double>]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<bfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29:   required from here
  113 |         breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = bfs_time_visitor<long unsigned int*>; Graph = R_adjacency_list<boost::directedS, double>]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29:   required from here
  113 |         breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<dfs_time_visitor<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<dfs_time_visitor<long unsigned int*> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<dfs_time_visitor<long unsigned int*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<dfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = dfs_time_visitor<long unsigned int*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue<C>::~ColorValue() [with C = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  505 |     BOOST_CONCEPT_USAGE(ColorValue)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::components_recorder<int*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::components_recorder<int*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::components_recorder<int*> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::components_recorder<int*>; Graph = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:188:9:   required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >::~VertexListGraphConcept()’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::dummy_property_map, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:190:9:   required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::dummy_property_map; Key = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:192:9:   required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
  120 |         make_iterator_property_map(order.begin(), identity_property_map(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |             graph_traits< VertexListGraph >::null_vertex()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56:   required from here
  370 |         Vertex_Size_Type n = sequential_vertex_coloring( g, color );
      |                              ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:75:21:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >]’
   75 |     topological_sort(
      |     ~~~~~~~~~~~~~~~~^
   76 |         g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:71:29:   required from here
   71 |             topological_sort(g, std::front_inserter(tsord));
      |             ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >; Graph = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >, R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >, R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >, R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:75:21:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >]’
   75 |     topological_sort(
      |     ~~~~~~~~~~~~~~~~^
   76 |         g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:71:29:   required from here
   71 |             topological_sort(g, std::front_inserter(tsord));
      |             ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<bfs_time_visitor<long unsigned int*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<bfs_time_visitor<long unsigned int*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29:   required from here
  113 |         breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<bfs_time_visitor<long unsigned int*> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = bfs_time_visitor<long unsigned int*>; Graph = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<bfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<bfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<bfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29:   required from here
  113 |         breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29:   required from here
  113 |         breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29:   required from here
  113 |         breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29:   required from here
  113 |         breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29:   required from here
  113 |         breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::components_recorder<int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::components_recorder<int*> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::components_recorder<int*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::components_recorder<int*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<int*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:115:9:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:162:42:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  162 |             return strong_components_impl(g, comp, r_map,
      |                    ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
  163 |                 make_iterator_property_map(time_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~    
  165 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  166 |                     time_vec[0]),
      |                     ~~~~~~~~~~~~~         
  167 |                 params);
      |                 ~~~~~~~                   
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
  177 |         return strong_comp_dispatch2< DiscoverTimeMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  178 |             g, comp, r_map, params, time_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  249 |     return strong_components(g, comp, params);
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26:   required from here
  232 |         strong_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = int*; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
  177 |         return strong_comp_dispatch2< DiscoverTimeMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  178 |             g, comp, r_map, params, time_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  249 |     return strong_components(g, comp, params);
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26:   required from here
  232 |         strong_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:119:9:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:162:42:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  162 |             return strong_components_impl(g, comp, r_map,
      |                    ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
  163 |                 make_iterator_property_map(time_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~    
  165 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  166 |                     time_vec[0]),
      |                     ~~~~~~~~~~~~~         
  167 |                 params);
      |                 ~~~~~~~                   
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
  177 |         return strong_comp_dispatch2< DiscoverTimeMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  178 |             g, comp, r_map, params, time_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  249 |     return strong_components(g, comp, params);
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26:   required from here
  232 |         strong_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<long unsigned int, long unsigned int>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:190:9:   required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:417:34:   required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; std::size_t = long unsigned int]’
  417 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  418 |         g, comp, graph_detail::dummy_output_iterator())
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:264:47:   required from here
  264 |         int num_comps = biconnected_components(g, component);
      |                         ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::dummy_property_map; Key = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::dummy_property_map, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::dummy_property_map, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::dummy_property_map, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:75:21:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >]’
   75 |     topological_sort(
      |     ~~~~~~~~~~~~~~~~^
   76 |         g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:71:29:   required from here
   71 |             topological_sort(g, std::front_inserter(tsord));
      |             ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<bfs_time_visitor<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<bfs_time_visitor<long unsigned int*> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<bfs_time_visitor<long unsigned int*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29:   required from here
  113 |         breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = bfs_time_visitor<long unsigned int*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29:   required from here
  113 |         breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29:   required from here
  113 |         breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29:   required from here
  113 |         breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<int*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = int*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<int*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<int*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<int*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<int*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:115:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
  177 |         return strong_comp_dispatch2< DiscoverTimeMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  178 |             g, comp, r_map, params, time_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  249 |     return strong_components(g, comp, params);
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26:   required from here
  232 |         strong_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = int*; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
  177 |         return strong_comp_dispatch2< DiscoverTimeMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  178 |             g, comp, r_map, params, time_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  249 |     return strong_components(g, comp, params);
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26:   required from here
  232 |         strong_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = long unsigned int; Y = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:188:9:   required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:188:9:   required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29:   required from here
  113 |         breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:188:9:   required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::biconnected_components_visitor<dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, dfs_visitor<> >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::biconnected_components_visitor<dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, dfs_visitor<> >, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::biconnected_components_visitor<dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, dfs_visitor<> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:211:27:   required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
  211 |         depth_first_search(g, visitor(vis).vertex_index_map(index_map));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29:   required from here
  205 |         connected_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = detail::tarjan_scc_visitor<int*, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = detail::tarjan_scc_visitor<int*, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; T = graph_visitor_t; R = bgl_named_params<int, int>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::tarjan_scc_visitor<int*, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:129:27:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
  177 |         return strong_comp_dispatch2< DiscoverTimeMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  178 |             g, comp, r_map, params, time_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  249 |     return strong_components(g, comp, params);
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26:   required from here
  232 |         strong_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; Graph = R_adjacency_list<boost::directedS, double>]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::biconnected_components_visitor<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, graph_detail::dummy_output_iterator, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, dfs_visitor<> >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<undirectedS, double>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::biconnected_components_visitor<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, graph_detail::dummy_output_iterator, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, dfs_visitor<> >, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::biconnected_components_visitor<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, graph_detail::dummy_output_iterator, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, dfs_visitor<> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:211:27:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:417:34:   required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; std::size_t = long unsigned int]’
  417 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  418 |         g, comp, graph_detail::dummy_output_iterator())
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:264:47:   required from here
  264 |         int num_comps = biconnected_components(g, component);
      |                         ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const dfs_time_visitor<long unsigned int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
interfaces.cpp:158:27:   required from here
  158 |         depth_first_search(g, visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
  177 |         return strong_comp_dispatch2< DiscoverTimeMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  178 |             g, comp, r_map, params, time_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  249 |     return strong_components(g, comp, params);
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26:   required from here
  232 |         strong_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; Graph = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
  177 |         return strong_comp_dispatch2< DiscoverTimeMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  178 |             g, comp, r_map, params, time_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  249 |     return strong_components(g, comp, params);
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26:   required from here
  232 |         strong_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:417:34:   required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; std::size_t = long unsigned int]’
  417 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  418 |         g, comp, graph_detail::dummy_output_iterator())
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:264:47:   required from here
  264 |         int num_comps = biconnected_components(g, component);
      |                         ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:417:34:   required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; std::size_t = long unsigned int]’
  417 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  418 |         g, comp, graph_detail::dummy_output_iterator())
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:264:47:   required from here
  264 |         int num_comps = biconnected_components(g, component);
      |                         ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34:   required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  433 |     return biconnected_components(g, dummy_property_map(), out,
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  434 |         bgl_named_params< int, buffer_param_t >(0))
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28:   required from here
  300 |         articulation_points(g, std::back_inserter(art_points));
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42:   required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
  146 |         alpha_S_k = edmonds_karp_max_flow(
      |                     ~~~~~~~~~~~~~~~~~~~~~^
  147 |             flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34:   required from here
  326 |         dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
  177 |         return strong_comp_dispatch2< DiscoverTimeMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  178 |             g, comp, r_map, params, time_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  249 |     return strong_components(g, comp, params);
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26:   required from here
  232 |         strong_components(g, &component[0]);
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:417:34:   required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; std::size_t = long unsigned int]’
  417 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  418 |         g, comp, graph_detail::dummy_output_iterator())
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:264:47:   required from here
  264 |         int num_comps = biconnected_components(g, component);
      |                         ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/tuple/tuple.hpp:28,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_traits.hpp:16,
                 from RBGL.hpp:37:
In member function ‘boost::tuples::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>& boost::tuples::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>::operator=(const std::pair<_U1, _U2>&) [with U1 = long unsigned int; U2 = long unsigned int; T0 = long unsigned int&; T1 = long unsigned int&; T2 = boost::tuples::null_type; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]’,
    inlined from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:130:26:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/tuple/detail/tuple_basic.hpp:592:16: warning: ‘p’ may be used uninitialized [-Wmaybe-uninitialized]
  592 |     this->head = k.first;
      |     ~~~~~~~~~~~^~~~~~~~~
In file included from interfaces.cpp:7:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp: In function ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:34:44: note: ‘p’ was declared here
   34 |         typename Traits::vertex_descriptor p;
      |                                            ^
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c minST.cpp -o minST.o
In file included from minST.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
minST.cpp: In function ‘SEXPREC* BGL_KMST_D(SEXP, SEXP, SEXP, SEXP)’:
minST.cpp:14:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
   14 |         typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
      |                                                              ^~~~~~
minST.cpp: In function ‘SEXPREC* BGL_KMST_U(SEXP, SEXP, SEXP, SEXP)’:
minST.cpp:48:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
   48 |         typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
      |                                                              ^~~~~~
minST.cpp: In function ‘SEXPREC* BGL_PRIM_U(SEXP, SEXP, SEXP, SEXP)’:
minST.cpp:81:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
   81 |         typedef graph_traits < Graph_ud >::edge_descriptor Edge;
      |                                                            ^~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
                 from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >::~VertexListGraphConcept()’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >::~EdgeListGraphConcept()’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5:   required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >::~OutputIteratorConcept()’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<double>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:251:3:   required from ‘struct boost::ComparableConcept<double>’
  251 |   BOOST_concept(Comparable,(TT))
      |                 ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ComparableConcept<double>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ComparableConcept<double> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ComparableConcept<double> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ComparableConcept<double>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<double>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ComparableConcept<double>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:251:17: note: in a call to non-static member function ‘boost::ComparableConcept<double>::~ComparableConcept()’
  251 |   BOOST_concept(Comparable,(TT))
      |                 ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:251:3: note: in expansion of macro ‘BOOST_concept’
  251 |   BOOST_concept(Comparable,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ConvertibleConcept<long unsigned int, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<long unsigned int, long unsigned int>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::IntegerConcept<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:66:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:70:17: note: in a call to non-static member function ‘boost::IntegerConcept<long unsigned int>::~IntegerConcept()’
   70 |   BOOST_concept(Integer, (T))
      |                 ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:70:3: note: in expansion of macro ‘BOOST_concept’
   70 |   BOOST_concept(Integer, (T))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >::~VertexListGraphConcept()’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<R_adjacency_list<boost::undirectedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >::~EdgeListGraphConcept()’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5:   required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >::~OutputIteratorConcept()’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5:   required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator<TT, ValueT>::~OutputIterator() [with TT = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >; ValueT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  529 |     BOOST_CONCEPT_USAGE(OutputIterator) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<double>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<double> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<double>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:251:3:   required from ‘struct boost::ComparableConcept<double>’
  251 |   BOOST_concept(Comparable,(TT))
      |                 ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ComparableConcept<double>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ComparableConcept<double> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ComparableConcept<double> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ComparableConcept<double>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = double]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ConvertibleConcept<long unsigned int, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = long unsigned int; Y = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<R_adjacency_list<boost::undirectedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5:   required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3:   required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
  526 |   BOOST_concept(OutputIterator,(TT)(ValueT))
      |                 ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator<TT, ValueT>::~OutputIterator() [with TT = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >; ValueT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  529 |     BOOST_CONCEPT_USAGE(OutputIterator) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
  107 |   template <> struct SignedInteger<long> {};
      |                      ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:20:38:   required from here
   20 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9:   required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29:   required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  112 |     detail::kruskal_mst_impl(g, spanning_tree_edges,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
  113 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114 |             rank_map.begin(), get(vertex_index, g), rank_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  115 |         make_iterator_property_map(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  116 |             pred_map.begin(), get(vertex_index, g), pred_map[0]),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~ 
minST.cpp:54:38:   required from here
   54 |         kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:15,
                 from minST.cpp:3:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:39:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46:   required from ‘static boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::type boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = R_adjacency_list<boost::undirectedS, double>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>]’
  245 |             return make_iterator_property_map(array_holder.get(), index);
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33:   required from ‘static boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::type boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = R_adjacency_list<boost::undirectedS, double>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>]’
  273 |             return helper::build(g, index, array_holder);
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  377 |         = IndexInHeapMapHelper::build(g, index_map, index_in_heap_map_holder);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<long unsigned int*>::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35:   required from here
   89 |         prim_minimum_spanning_tree(g, &parent[0]);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/string:48,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/locale_classes.h:40,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/ios_base.h:41,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/ios:44,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/ostream:40,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/iostream:41,
                 from RBGL.hpp:7:
In function ‘bool __gnu_cxx::operator==(const __normal_iterator<_Iterator, _Container>&, const __normal_iterator<_Iterator, _Container>&) [with _Iterator = boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*; _Container = std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’,
    inlined from ‘bool boost::iterators::iterator_adaptor<Derived, Base, Value, Traversal, Reference, Difference>::equal(const boost::iterators::iterator_adaptor<OtherDerived, OtherIterator, V, C, R, D>&) const [with OtherDerived = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; OtherIterator = __gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >; V = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; C = boost::use_default; R = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; D = long int; Derived = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Base = __gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >; Value = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Traversal = boost::use_default; Reference = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Difference = long int]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_adaptor.hpp:305:29,
    inlined from ‘static bool boost::iterators::iterator_core_access::equal(const Facade1&, const Facade2&, mpl_::true_) [with Facade1 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Facade2 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_facade.hpp:649:26,
    inlined from ‘typename boost::iterators::detail::enable_if_interoperable<Derived1, Derived2, typename boost::mpl::apply2<boost::iterators::detail::always_bool2, Derived1, Derived2>::type>::type boost::iterators::operator!=(const iterator_facade<Derived1, V1, TC1, Reference1, Difference1>&, const iterator_facade<Derived2, V2, TC2, Reference2, Difference2>&) [with Derived1 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; V1 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; TC1 = random_access_traversal_tag; Reference1 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Difference1 = long int; Derived2 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; V2 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; TC2 = random_access_traversal_tag; Reference2 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Difference2 = long int]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_facade.hpp:982:3,
    inlined from ‘bool boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator<long unsigned int>; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/adj_list_edge_iterator.hpp:113:25,
    inlined from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:79:51,
    inlined from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29,
    inlined from ‘SEXPREC* BGL_KMST_D(SEXP, SEXP, SEXP, SEXP)’ at minST.cpp:20:38:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_iterator.h:1219:27: warning: ‘*(boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >* const*)((char*)&eiend + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >::edges.boost::optional<std::pair<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::<unnamed>.boost::optional_detail::optional_base<std::pair<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::m_storage.boost::optional_detail::aligned_storage<std::pair<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::dummy_))’ may be used uninitialized [-Wmaybe-uninitialized]
 1219 |     { return __lhs.base() == __rhs.base(); }
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~
In file included from minST.cpp:2:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp: In function ‘SEXPREC* BGL_KMST_D(SEXP, SEXP, SEXP, SEXP)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:78:59: note: ‘eiend’ declared here
   78 |         typename graph_traits< Graph >::edge_iterator ei, eiend;
      |                                                           ^~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c mincut.cpp -o mincut.o
In file included from mincut.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
                 from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:20,
                 from mincut.hpp:4,
                 from mincut.cpp:2:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:39:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
  107 |   template <> struct SignedInteger<long> {};
      |                      ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:39:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
mincut.hpp:78:21:   required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
   77 |         alpha_S_k = edmonds_karp_max_flow
      |                     ~~~~~~~~~~~~~~~~~~~~~
   78 |                     (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35:   required from here
  128 |         dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45:   required from here
   76 |              maxflow = edmonds_karp_max_flow(flow_g, s, t);
      |                        ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/string:48,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/locale_classes.h:40,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/ios_base.h:41,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/ios:44,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/ostream:40,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/iostream:41,
                 from RBGL.hpp:7:
In function ‘bool __gnu_cxx::operator==(const __normal_iterator<_Iterator, _Container>&, const __normal_iterator<_Iterator, _Container>&) [with _Iterator = boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*; _Container = std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > >]’,
    inlined from ‘bool boost::iterators::iterator_adaptor<Derived, Base, Value, Traversal, Reference, Difference>::equal(const boost::iterators::iterator_adaptor<OtherDerived, OtherIterator, V, C, R, D>&) const [with OtherDerived = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; OtherIterator = __gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >; V = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; C = boost::use_default; R = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; D = long int; Derived = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Base = __gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >; Value = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Traversal = boost::use_default; Reference = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Difference = long int]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_adaptor.hpp:305:29,
    inlined from ‘static bool boost::iterators::iterator_core_access::equal(const Facade1&, const Facade2&, mpl_::true_) [with Facade1 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Facade2 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_facade.hpp:649:26,
    inlined from ‘typename boost::iterators::detail::enable_if_interoperable<Derived1, Derived2, typename boost::mpl::apply2<boost::iterators::detail::always_bool2, Derived1, Derived2>::type>::type boost::iterators::operator!=(const iterator_facade<Derived1, V1, TC1, Reference1, Difference1>&, const iterator_facade<Derived2, V2, TC2, Reference2, Difference2>&) [with Derived1 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; V1 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; TC1 = random_access_traversal_tag; Reference1 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Difference1 = long int; Derived2 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; V2 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; TC2 = random_access_traversal_tag; Reference2 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Difference2 = long int]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_facade.hpp:982:3,
    inlined from ‘bool boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator<long unsigned int>; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/adj_list_edge_iterator.hpp:113:25,
    inlined from ‘SEXPREC* BGL_max_flow_internal(SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, E_MF_METHOD)’ at mincut.cpp:101:45:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_iterator.h:1219:27: warning: ‘*(boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > >, boost::no_property, boost::listS> >::edges.boost::optional<std::pair<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::<unnamed>.boost::optional_detail::optional_base<std::pair<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::m_storage.boost::optional_detail::aligned_storage<std::pair<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::no_property> > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::dummy_))’ may be used uninitialized [-Wmaybe-uninitialized]
 1219 |     { return __lhs.base() == __rhs.base(); }
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~
mincut.cpp: In function ‘SEXPREC* BGL_max_flow_internal(SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, E_MF_METHOD)’:
mincut.cpp:99:23: note: ‘e_end’ declared here
   99 |     edge_iterator ei, e_end;
      |                       ^~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/set:62,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:18:
In member function ‘std::pair<std::_Rb_tree_iterator<_Val>, bool> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_unique(_Arg&&) [with _Arg = const long unsigned int&; _Key = long unsigned int; _Val = long unsigned int; _KeyOfValue = std::_Identity<long unsigned int>; _Compare = std::less<long unsigned int>; _Alloc = std::allocator<long unsigned int>]’,
    inlined from ‘std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = long unsigned int; _Compare = std::less<long unsigned int>; _Alloc = std::allocator<long unsigned int>]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_set.h:514:25,
    inlined from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’ at mincut.hpp:67:13:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_tree.h:2167:35: warning: ‘p’ may be used uninitialized [-Wmaybe-uninitialized]
 2167 |         = _M_get_insert_unique_pos(_KeyOfValue()(__v));
      |           ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp: In function ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:34:44: note: ‘p’ was declared here
   34 |         typename Traits::vertex_descriptor p;
      |                                            ^
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c ordering.cpp -o ordering.o
In file included from ordering.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/bind/mem_fn.hpp:23,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/bind/bind.hpp:23,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/king_ordering.hpp:18,
                 from ordering.cpp:9:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
ordering.cpp: In function ‘SEXPREC* BGL_min_degree_ordering(SEXP, SEXP, SEXP, SEXP)’:
ordering.cpp:133:67: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
  133 |                 typedef graph_traits<Graph_dd>::vertex_descriptor Vertex;
      |                                                                   ^~~~~~
ordering.cpp: In function ‘SEXPREC* BGL_king_ordering(SEXP, SEXP, SEXP, SEXP)’:
ordering.cpp:182:62: warning: variable ‘id’ set but not used [-Wunused-but-set-variable]
  182 |                 property_map<Graph_dd, vertex_index_t>::type id = get(vertex_index, g);
      |                                                              ^~
ordering.cpp:176:67: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
  176 |                 typedef graph_traits<Graph_dd>::vertex_descriptor Vertex;
      |                                                                   ^~~~~~
ordering.cpp: In function ‘SEXPREC* BGL_sloan_ordering(SEXP, SEXP, SEXP, SEXP, SEXP)’:
ordering.cpp:232:61: warning: typedef ‘Pair’ locally defined but not used [-Wunused-local-typedefs]
  232 |                 typedef std::pair<std::size_t, std::size_t> Pair;
      |                                                             ^~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
                 from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<long unsigned int*>::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<int*>::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/pending/bucket_sorter.hpp:32:5:   required from ‘class boost::bucket_sorter<long unsigned int, long unsigned int, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21:   required from ‘class boost::detail::mmd_impl<R_adjacency_list<boost::directedS, double>, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’
  336 |         DegreeLists degreelists;
      |                     ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9:   required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; DegreeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  752 |         impl(G, num_vertices(G), delta, degree, inverse_perm, perm,
      |         ^~~~
ordering.cpp:141:26:   required from here
  141 |                 minimum_degree_ordering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~^~~
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  143 |                         &inverse_perm[0],
      |                         ~~~~~~~~~~~~~~~~~
  144 |                         &perm[0],
      |                         ~~~~~~~~~       
  145 |                         make_iterator_property_map(&supernode_sizes[0], id, supernode_sizes[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  146 |                         delta, id);
      |                         ~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:116:60:   required from here
  116 |                 INTEGER(rbw)[0] = bandwidth(g, make_iterator_property_map(&perm[0], index_map, perm[0]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:142:30:   required from here
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/pending/bucket_sorter.hpp:32:5:   required from ‘class boost::bucket_sorter<long unsigned int, long unsigned int, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21:   required from ‘class boost::detail::mmd_impl<R_adjacency_list<boost::directedS, double>, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’
  336 |         DegreeLists degreelists;
      |                     ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9:   required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; DegreeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  752 |         impl(G, num_vertices(G), delta, degree, inverse_perm, perm,
      |         ^~~~
ordering.cpp:141:26:   required from here
  141 |                 minimum_degree_ordering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~^~~
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  143 |                         &inverse_perm[0],
      |                         ~~~~~~~~~~~~~~~~~
  144 |                         &perm[0],
      |                         ~~~~~~~~~       
  145 |                         make_iterator_property_map(&supernode_sizes[0], id, supernode_sizes[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  146 |                         delta, id);
      |                         ~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/pending/bucket_sorter.hpp:32:5:   required from ‘class boost::bucket_sorter<long unsigned int, long unsigned int, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21:   required from ‘class boost::detail::mmd_impl<R_adjacency_list<boost::directedS, double>, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’
  336 |         DegreeLists degreelists;
      |                     ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9:   required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; DegreeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  752 |         impl(G, num_vertices(G), delta, degree, inverse_perm, perm,
      |         ^~~~
ordering.cpp:141:26:   required from here
  141 |                 minimum_degree_ordering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~^~~
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  143 |                         &inverse_perm[0],
      |                         ~~~~~~~~~~~~~~~~~
  144 |                         &perm[0],
      |                         ~~~~~~~~~       
  145 |                         make_iterator_property_map(&supernode_sizes[0], id, supernode_sizes[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  146 |                         delta, id);
      |                         ~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:16,
                 from ordering.cpp:2:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::dfs_visitor<>; Graph = R_adjacency_list<boost::undirectedS, double>]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept<boost::default_color_type>::~ColorValueConcept()’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’
  502 | BOOST_concept(ColorValue, (C))
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/pending/bucket_sorter.hpp:32:5:   required from ‘class boost::bucket_sorter<long unsigned int, long unsigned int, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21:   required from ‘class boost::detail::mmd_impl<R_adjacency_list<boost::directedS, double>, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’
  336 |         DegreeLists degreelists;
      |                     ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9:   required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; DegreeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  752 |         impl(G, num_vertices(G), delta, degree, inverse_perm, perm,
      |         ^~~~
ordering.cpp:141:26:   required from here
  141 |                 minimum_degree_ordering(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~^~~
  142 |                         make_iterator_property_map(&degree[0], id, degree[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  143 |                         &inverse_perm[0],
      |                         ~~~~~~~~~~~~~~~~~
  144 |                         &perm[0],
      |                         ~~~~~~~~~       
  145 |                         make_iterator_property_map(&supernode_sizes[0], id, supernode_sizes[0]),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  146 |                         delta, id);
      |                         ~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
  107 |   template <> struct SignedInteger<long> {};
      |                      ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >::~VertexListGraphConcept()’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >::~EdgeListGraphConcept()’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:321:7:   required from ‘struct boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘struct boost::AdaptableUnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘struct boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:577:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:577:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:17: note: in a call to non-static member function ‘boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>::~AdaptableUnaryFunctionConcept()’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3: note: in expansion of macro ‘BOOST_concept’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:588:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; Key = void*]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::dfs_visitor<> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::dfs_visitor<> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::dfs_visitor<> >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::dfs_visitor<> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::dfs_visitor<> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::dfs_visitor<> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> > >’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::dfs_visitor<> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::dfs_visitor<> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::dfs_visitor<>; Graph = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::dfs_visitor<> >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue<C>::~ColorValue() [with C = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  505 |     BOOST_CONCEPT_USAGE(ColorValue)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >, R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, degree_property_map<R_adjacency_list<undirectedS, double> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, degree_property_map<R_adjacency_list<undirectedS, double> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque<typename graph_traits<Graph>::vertex_descriptor, std::allocator<typename graph_traits<Graph>::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  105 |         breadth_first_visit(g, s, Q, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  157 |     return cuthill_mckee_ordering(G, vertex_queue, permutation, color, degree);
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/sparse_ordering.hpp:20,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:15,
                 from ordering.cpp:3:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >; Graph = R_adjacency_list<boost::undirectedS, double>]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:69:31:   required from here
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:321:7:   required from ‘struct boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘struct boost::AdaptableUnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘struct boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:577:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::UnaryFunction<Func, Return, Arg>::~UnaryFunction() [with Func = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Return = long unsigned int; Arg = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:321:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  321 |       BOOST_CONCEPT_USAGE(UnaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:588:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; Key = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:588:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::dfs_visitor<> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::dfs_visitor<> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::dfs_visitor<> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::dfs_visitor<> >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::dfs_visitor<> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::dfs_visitor<> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::dfs_visitor<>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >, R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, degree_property_map<R_adjacency_list<undirectedS, double> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, degree_property_map<R_adjacency_list<undirectedS, double> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque<typename graph_traits<Graph>::vertex_descriptor, std::allocator<typename graph_traits<Graph>::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  105 |         breadth_first_visit(g, s, Q, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  157 |     return cuthill_mckee_ordering(G, vertex_queue, permutation, color, degree);
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >; Graph = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >, R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >, R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >, R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >, R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, degree_property_map<R_adjacency_list<undirectedS, double> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, degree_property_map<R_adjacency_list<undirectedS, double> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque<typename graph_traits<Graph>::vertex_descriptor, std::allocator<typename graph_traits<Graph>::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  105 |         breadth_first_visit(g, s, Q, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  157 |     return cuthill_mckee_ordering(G, vertex_queue, permutation, color, degree);
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<long unsigned int, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<long unsigned int, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<long unsigned int, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:577:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:450:11:   required from ‘boost::AdaptableUnaryFunction<Func, Return, Arg>::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Return = long unsigned int; Arg = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:577:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = long unsigned int; Y = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<void*, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<void*, void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<void*, void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<void*, void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<void*, void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:577:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<void*, void*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<void*, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:463:11:   required from ‘boost::AdaptableUnaryFunction<Func, Return, Arg>::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Return = long unsigned int; Arg = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:577:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = void*; Y = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:588:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::safe_iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator<char*, std::vector<char> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = char; typename std::iterator_traits< <template-parameter-1-1> >::reference = char&; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_concepts.hpp:114:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_concepts.hpp:114:7:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:152:13:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:152:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:281:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:281:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:191:13:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:191:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:321:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:321:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:321:9:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:322:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:322:9:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:218:14:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:218:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:355:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:355:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:355:9:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:356:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:356:9:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:239:14:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:239:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:373:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:373:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:373:9:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:374:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:374:9:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&) [with RandomAccessRange = std::vector<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/size_type.hpp:20,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/size.hpp:21,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/functions.hpp:20,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/iterator_range_core.hpp:38,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/iterator_range.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/irange.hpp:16,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/adjacency_list.hpp:21,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:255:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<std::vector<long unsigned int> >::~RandomAccessRangeConcept()’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<const std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<const std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:213:23:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  213 |             if (!equal(invar1_array, invar2_array))
      |                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<const std::vector<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<const std::vector<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/equal.hpp:174:13:   required from ‘bool boost::range::equal(const SinglePassRange1&, const SinglePassRange2&) [with SinglePassRange1 = std::vector<long unsigned int>; SinglePassRange2 = std::vector<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:213:23:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  213 |             if (!equal(invar1_array, invar2_array))
      |                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const std::vector<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<void*> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:281:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:281:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<void*> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<void*> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<void*> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:321:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:321:9:   required from ‘struct boost::ForwardRangeConcept<std::vector<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:322:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:322:9:   required from ‘struct boost::ForwardRangeConcept<std::vector<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:355:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:355:9:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:356:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:356:9:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:373:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:373:9:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:374:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:374:9:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<void*>; BinaryPredicate = boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::compare_multiplicity]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<std::vector<void*> >::~RandomAccessRangeConcept()’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::safe_iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = int; typename std::iterator_traits< <template-parameter-1-1> >::reference = int&; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:281:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:281:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:321:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:321:9:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:322:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:322:9:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:355:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:355:9:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:356:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:356:9:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:373:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:373:9:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:374:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:374:9:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >; BinaryPredicate = boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::edge_cmp]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >::~RandomAccessRangeConcept()’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<>, R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = sparse::rcm_queue<long unsigned int, degree_property_map<R_adjacency_list<undirectedS, double> >, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = sparse::rcm_queue<long unsigned int, degree_property_map<R_adjacency_list<undirectedS, double> >, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:363:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; P = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; T = vertex_color_t; R = bgl_named_params<reference_wrapper<sparse::rcm_queue<long unsigned int, degree_property_map<R_adjacency_list<undirectedS, double> >, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, buffer_param_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  363 |     breadth_first_visit(ng, s,
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~
  364 |         choose_param(get_param(params, buffer_param_t()), boost::ref(Q)).get(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  365 |         choose_param(
      |         ~~~~~~~~~~~~~   
  366 |             get_param(params, graph_visitor), make_bfs_visitor(null_visitor())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  367 |         choose_pmap(get_param(params, vertex_color), ng, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24:   required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; Vertex = long unsigned int; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  152 |     breadth_first_visit(G, u, buffer(Q).color_map(color));
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31:   required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list<undirectedS, double>; Vertex = long unsigned int; Color = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  170 |     x = pseudo_peripheral_pair(G, r, eccen_r, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  155 |         *i = find_starting_node(G, *i, color, degree);
      |              ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<>; Graph = R_adjacency_list<boost::undirectedS, double>]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >, R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, degree_property_map<R_adjacency_list<undirectedS, double> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, degree_property_map<R_adjacency_list<undirectedS, double> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque<typename graph_traits<Graph>::vertex_descriptor, std::allocator<typename graph_traits<Graph>::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  105 |         breadth_first_visit(g, s, Q, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  157 |     return cuthill_mckee_ordering(G, vertex_queue, permutation, color, degree);
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<long unsigned int, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<long unsigned int, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<long unsigned int, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:577:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = long unsigned int; Y = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<void*, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<void*, void*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<void*, void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<void*, void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<void*, void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<void*, void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:577:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = void*; Y = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<char*, std::vector<char> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<char*, std::vector<char> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<char*, std::vector<char> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<char*, std::vector<char> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<char*, std::vector<char> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<char*, std::vector<char> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<char*, std::vector<char> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::vector<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<const std::vector<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<const std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<const std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:213:23:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  213 |             if (!equal(invar1_array, invar2_array))
      |                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const std::vector<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<void*> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<void*> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::vector<void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:220:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  220 |             sort(V_mult, compare_multiplicity(invariant1, multiplicities(invar1_array.begin(), invar1_array.end())));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; DFSVisitor = detail::isomorphism_algo<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>, degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >, degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, unordered::unordered_flat_map<long unsigned int, long unsigned int, hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; DFSVisitor = detail::isomorphism_algo<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>, degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >, degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, unordered::unordered_flat_map<long unsigned int, long unsigned int, hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; DFSVisitor = detail::isomorphism_algo<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>, degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >, degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, unordered::unordered_flat_map<long unsigned int, long unsigned int, hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<int*, std::vector<int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<int*, std::vector<int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<int*, std::vector<int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<int*, std::vector<int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<int*, std::vector<int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<int*, std::vector<int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<int*, std::vector<int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, void*>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_concepts.hpp:114:7:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_concepts.hpp:114:7:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = boost::iterators::incrementable_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:152:13:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:152:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = boost::iterators::single_pass_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   required from ‘struct boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/equal.hpp:174:13:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/equal.hpp:174:13:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/equal.hpp:174:13:   required from ‘typename boost::range_difference<const SinglePassRange>::type boost::range::count_if(const SinglePassRange&, UnaryPredicate) [with SinglePassRange = std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >; UnaryPredicate = boost::indirect_pmap<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<char*, std::vector<char> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, char, char&> >; typename boost::range_difference<const SinglePassRange>::type = long int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:333:51:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::match(edge_iter, int) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; edge_iter = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, void*>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, void*> > >::iterator]’
  333 |                         num_edges_on_k -= count_if(adjacent_vertices(f[vk], G2),
      |                                           ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  334 |                             make_indirect_pmap(in_S));
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::bfs_visitor<> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<> >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = sparse::rcm_queue<long unsigned int, degree_property_map<R_adjacency_list<undirectedS, double> >, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:363:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; P = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; T = vertex_color_t; R = bgl_named_params<reference_wrapper<sparse::rcm_queue<long unsigned int, degree_property_map<R_adjacency_list<undirectedS, double> >, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, buffer_param_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  363 |     breadth_first_visit(ng, s,
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~
  364 |         choose_param(get_param(params, buffer_param_t()), boost::ref(Q)).get(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  365 |         choose_param(
      |         ~~~~~~~~~~~~~   
  366 |             get_param(params, graph_visitor), make_bfs_visitor(null_visitor())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  367 |         choose_pmap(get_param(params, vertex_color), ng, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24:   required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; Vertex = long unsigned int; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  152 |     breadth_first_visit(G, u, buffer(Q).color_map(color));
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31:   required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list<undirectedS, double>; Vertex = long unsigned int; Color = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  170 |     x = pseudo_peripheral_pair(G, r, eccen_r, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  155 |         *i = find_starting_node(G, *i, color, degree);
      |              ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<>; Graph = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<>, R_adjacency_list<boost::undirectedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<>, R_adjacency_list<boost::undirectedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<>, R_adjacency_list<boost::undirectedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = sparse::rcm_queue<long unsigned int, degree_property_map<R_adjacency_list<undirectedS, double> >, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:363:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; P = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; T = vertex_color_t; R = bgl_named_params<reference_wrapper<sparse::rcm_queue<long unsigned int, degree_property_map<R_adjacency_list<undirectedS, double> >, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, buffer_param_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  363 |     breadth_first_visit(ng, s,
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~
  364 |         choose_param(get_param(params, buffer_param_t()), boost::ref(Q)).get(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  365 |         choose_param(
      |         ~~~~~~~~~~~~~   
  366 |             get_param(params, graph_visitor), make_bfs_visitor(null_visitor())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  367 |         choose_pmap(get_param(params, vertex_color), ng, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24:   required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; Vertex = long unsigned int; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  152 |     breadth_first_visit(G, u, buffer(Q).color_map(color));
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31:   required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list<undirectedS, double>; Vertex = long unsigned int; Color = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  170 |     x = pseudo_peripheral_pair(G, r, eccen_r, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  155 |         *i = find_starting_node(G, *i, color, degree);
      |              ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::bfs_visitor<> >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<void*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<void*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<void*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = void*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_List_iterator<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::_List_iterator<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<std::_List_iterator<void*> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_List_iterator<void*> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<std::_List_iterator<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<std::_List_iterator<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<std::_List_iterator<void*> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::_List_iterator<void*> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_List_iterator<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<std::_List_iterator<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<std::_List_iterator<void*> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_List_iterator<void*> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<std::_List_iterator<void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = boost::iterators::incrementable_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = boost::iterators::single_pass_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::bfs_visitor<> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<> >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = sparse::rcm_queue<long unsigned int, degree_property_map<R_adjacency_list<undirectedS, double> >, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  118 |     breadth_first_visit(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:363:24:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; P = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; T = vertex_color_t; R = bgl_named_params<reference_wrapper<sparse::rcm_queue<long unsigned int, degree_property_map<R_adjacency_list<undirectedS, double> >, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, buffer_param_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  363 |     breadth_first_visit(ng, s,
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~
  364 |         choose_param(get_param(params, buffer_param_t()), boost::ref(Q)).get(),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  365 |         choose_param(
      |         ~~~~~~~~~~~~~   
  366 |             get_param(params, graph_visitor), make_bfs_visitor(null_visitor())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  367 |         choose_pmap(get_param(params, vertex_color), ng, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24:   required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; Vertex = long unsigned int; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  152 |     breadth_first_visit(G, u, buffer(Q).color_map(color));
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31:   required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list<undirectedS, double>; Vertex = long unsigned int; Color = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  170 |     x = pseudo_peripheral_pair(G, r, eccen_r, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  155 |         *i = find_starting_node(G, *i, color, degree);
      |              ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::bfs_visitor<>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; Graph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_List_iterator<void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_List_iterator<void*> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::_List_iterator<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<std::_List_iterator<void*> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = std::_List_iterator<void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::_List_iterator<void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<std::_List_iterator<void*> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<std::_List_iterator<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<std::_List_iterator<void*> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::_List_iterator<void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<std::_List_iterator<void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<std::_List_iterator<void*> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<std::_List_iterator<void*> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<std::_List_iterator<void*> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<std::_List_iterator<void*> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; DFSVisitor = detail::isomorphism_algo<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>, degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >, degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, unordered::unordered_flat_map<long unsigned int, long unsigned int, hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; Graph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = std::_List_iterator<void*>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<std::_List_iterator<void*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30:   required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’
  146 |             depth_first_visit(G, v, dfs_visitor<>(), color);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ordering.cpp:98:25:   required from here
   98 |                 cuthill_mckee_ordering(g, inv_perm.rbegin(), get(vertex_color, g), make_degree_map(g));
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int> >]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::bidirectional_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
ordering.cpp:68:18:   required from here
   68 |                 r = isomorphism(g1, g2, isomorphism_map
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
   69 |                         (make_iterator_property_map(f.begin(), v1_index_map, f[0])));
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29:   required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
  262 |         breadth_first_search(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  263 |             choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  264 |                 .get(),
      |                 ~~~~~~~      
  265 |             vis, color);
      |             ~~~~~~~~~~~      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23:   required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > > >; P = boost::bfs_visitor<boost::distance_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_degree_t, int, boost::property<boost::vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  309 |             bfs_helper(g, s,
      |             ~~~~~~~~~~^~~~~~
  310 |                 make_two_bit_color_map(num_vertices(g),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  311 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  312 |                         get_param(params, vertex_index), g, vertex_index)),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  313 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  314 |                     make_bfs_visitor(null_vis)),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  315 |                 params,
      |                 ~~~~~~~
  316 |                 boost::mpl::bool_<
      |                 ~~~~~~~~~~~~~~~~~~
  317 |                     boost::is_base_and_derived< distributed_graph_tag,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  318 |                         typename graph_traits<
      |                         ~~~~~~~~~~~~~~~~~~~~~~
  319 |                             VertexListGraph >::traversal_category >::value >());
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; P = bfs_visitor<distance_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > >, long unsigned int>, long unsigned int, long unsigned int&>, on_tree_edge> >; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  339 |     detail::bfs_dispatch< C >::apply(
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  340 |         ng, s, params, get_param(params, vertex_color));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:175:29:   required from ‘typename boost::graph_traits<G>::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename graph_traits<Graph>::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  175 |         breadth_first_search(G, s,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~
  176 |             visitor(
      |             ~~~~~~~~         
  177 |                 make_bfs_visitor(record_distances(dist_pmap, on_tree_edge()))));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sloan_ordering.hpp:429:33:   required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >; OutputIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Color = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, default_color_type, default_color_type&, vertex_color_t>; Degree = degree_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > > >; Priority = vec_adj_list_vertex_property_map<adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >, adjacency_list<setS, vecS, undirectedS, property<vertex_color_t, default_color_type, property<vertex_degree_t, int, property<vertex_priority_t, double> > > >*, double, double&, vertex_priority_t>; Weight = int]’
  429 |     e = sloan_start_end_vertices(G, s, color, degree);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ordering.cpp:245:17:   required from here
  245 |                 sloan_ordering(g, sloan_order.begin(), get(vertex_color, g),
      |                 ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  246 |                         make_degree_map(g), get(vertex_priority, g), W1, W2);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<std::_Rb_tree_const_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c planar.cpp -o planar.o
In file included from planar.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
planar.cpp: In function ‘SEXPREC* planarFaceTraversal(SEXP, SEXP, SEXP)’:
planar.cpp:161:31: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::vector<long unsigned int>, std::allocator<std::vector<long unsigned int> > >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  161 |            for ( int i = 0; i < v_vis.f_vis.size(); i++ )
      |                             ~~^~~~~~~~~~~~~~~~~~~~
planar.cpp:165:36: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<long unsigned int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  165 |                 for ( int j = 0; j < v_vis.f_vis[i].size(); j++ )
      |                                  ~~^~~~~~~~~~~~~~~~~~~~~~~
planar.cpp: In function ‘SEXPREC* planarCanonicalOrdering(SEXP, SEXP, SEXP)’:
planar.cpp:256:31: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<long unsigned int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  256 |            for ( int i = 0; i < ordering.size(); i++ )
      |                             ~~^~~~~~~~~~~~~~~~~
planar.cpp:225:39: warning: variable ‘oi_end’ set but not used [-Wunused-but-set-variable]
  225 |            Vertex_Vec_t::iterator oi, oi_end = ordering.end();
      |                                       ^~~~~~
planar.cpp: In function ‘SEXPREC* isStraightLineDrawing(SEXP, SEXP, SEXP, SEXP)’:
planar.cpp:369:35: warning: comparison of integer expressions of different signedness: ‘int’ and ‘boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >, boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int>, boost::no_property, boost::listS>::config::vertices_size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  369 |         for ( int i = 0, j = 0; i < num_vertices(g); i++ )
      |                                 ~~^~~~~~~~~~~~~~~~~
planar.cpp: In function ‘SEXPREC* isKuratowskiSubgraph(SEXP, SEXP, SEXP)’:
planar.cpp:429:37: warning: variable ‘ki_end’ set but not used [-Wunused-but-set-variable]
  429 |            Edge_Vec_t::iterator ki, ki_end = kuratowski_edges.end();
      |                                     ^~~~~~
planar.cpp:461:13: warning: unused variable ‘i’ [-Wunused-variable]
  461 |         int i, j = 0;
      |             ^
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:76:5:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:76:5:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:76:5:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
                 from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:76:5:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; DFSVisitor = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:12,
                 from planar.cpp:3:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >::~VertexListGraphConcept()’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >::~EdgeListGraphConcept()’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:321:7:   required from ‘struct boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘struct boost::AdaptableUnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int>’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘struct boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int>’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:577:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:17: note: in a call to non-static member function ‘boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int>::~AdaptableUnaryFunctionConcept()’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3: note: in expansion of macro ‘BOOST_concept’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:588:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; DFSVisitor = components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; DFSVisitor = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; DFSVisitor = components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; DFSVisitor = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; DFSVisitor = components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; DFSVisitor = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept<boost::default_color_type>::~ColorValueConcept()’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’
  502 | BOOST_concept(ColorValue, (C))
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >::~VertexListGraphConcept()’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:190:9:   required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; Key = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:192:9:   required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  250 |             return biconnected_components_impl(g, comp, out, index_map, dtm,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  251 |                 lowpt,
      |                 ~~~~~~                         
  252 |                 make_iterator_property_map(pred.begin(), index_map, vert),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  253 |                 choose_param(get_param(params, graph_visitor),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |                     make_dfs_visitor(null_visitor())));
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:321:7:   required from ‘struct boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘struct boost::AdaptableUnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int>’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘struct boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int>’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::UnaryFunction<Func, Return, Arg>::~UnaryFunction() [with Func = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; Return = long unsigned int; Arg = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:321:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  321 |       BOOST_CONCEPT_USAGE(UnaryFunction) { test(is_void<Return>()); }
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; DFSVisitor = planar_dfs_visitor<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>&>, long unsigned int>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<planar_dfs_visitor<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>&>, long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const planar_dfs_visitor<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>&>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27:   required from ‘boost::boyer_myrvold_impl<Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy>::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’
  251 |         depth_first_search(g, visitor(vis).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17:   required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list<boost::parameter::aux::flat_like_arg_tuple<boost::boyer_myrvold_params::tag::graph, boost::parameter::aux::tagged_argument_list_of_1<boost::parameter::aux::tagged_argument<boost::boyer_myrvold_params::tag::graph, const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::no_property>, boost::property<boost::edge_index_t, int, boost::no_property>, boost::no_property, boost::listS> > >, std::integral_constant<bool, true> > >; mpl_::true_ = mpl_::bool_<true>]’
   66 |                 planarity_tester(g, v_i_map);
      |                 ^~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44:   required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list<boost::parameter::aux::flat_like_arg_tuple<boost::boyer_myrvold_params::tag::graph, boost::parameter::aux::tagged_argument_list_of_1<boost::parameter::aux::tagged_argument<boost::boyer_myrvold_params::tag::graph, const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::no_property>, boost::property<boost::edge_index_t, int, boost::no_property>, boost::no_property, boost::listS> > >, std::integral_constant<bool, true> > >]’
  211 |             return dispatched_boyer_myrvold(args,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  212 |                 boost::is_same< embedding_arg_t, const no_planar_embedding& >(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  213 |                 boost::is_same< kuratowski_arg_t,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                     const no_kuratowski_subgraph_isolation& >());
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68:   required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >]’
  223 |     return boyer_myrvold_params::core::boyer_myrvold_planarity_test(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  224 |         boyer_myrvold_params::boyer_myrvold_params_t()(arg0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~       
planar.cpp:121:48:   required from here
  121 |         INTEGER(ans)[0] = boyer_myrvold_planarity_test(g);
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue<C>::~ColorValue() [with C = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  505 |     BOOST_CONCEPT_USAGE(ColorValue)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
  107 |   template <> struct SignedInteger<long> {};
      |                      ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:192:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<long unsigned int, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<long unsigned int, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<long unsigned int, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<long unsigned int, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:450:11:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:450:11:   required from ‘boost::AdaptableUnaryFunction<Func, Return, Arg>::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; Return = long unsigned int; Arg = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:454:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, long unsigned int, long unsigned int>]’
  454 |   BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg))
      |                 ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:577:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = long unsigned int; Y = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::safe_iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator<char*, std::vector<char> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = char; typename std::iterator_traits< <template-parameter-1-1> >::reference = char&; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:155:51:   required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; IsoMapping = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’
  155 |             in_S = make_safe_iterator_property_map(
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  156 |                 in_S_vec.begin(), in_S_vec.size(), index_map2
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                
  158 |                 ,
      |                 ~                                  
  159 |                 in_S_vec.front()
      |                 ~~~~~~~~~~~~~~~~                   
  160 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~          
  161 |             );
      |             ~                                      
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:603:9:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
  603 |         algo(G1, G2, f, invariant1, invariant2, 0, index_map1,
      |         ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_concepts.hpp:114:7:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_concepts.hpp:114:7:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:152:13:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:152:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:281:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:281:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:191:13:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:191:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:321:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:321:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:321:9:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:322:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:322:9:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:218:14:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:218:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:355:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:355:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:355:9:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:356:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:356:9:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:239:14:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:239:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:373:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:373:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:373:9:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/sort.hpp:32:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:374:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:374:9:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/sort.hpp:32:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&) [with RandomAccessRange = std::vector<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:206:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; IsoMapping = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  206 |             sort(invar1_array);
      |             ~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/size_type.hpp:20,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/size.hpp:21,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/functions.hpp:20,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/iterator_range_core.hpp:38,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/iterator_range.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/irange.hpp:16,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/adjacency_list.hpp:21,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:255:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<std::vector<long unsigned int> >::~RandomAccessRangeConcept()’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<const std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<const std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<const std::vector<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/equal.hpp:174:13:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<const std::vector<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<const std::vector<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/equal.hpp:174:13:   required from ‘bool boost::range::equal(const SinglePassRange1&, const SinglePassRange2&) [with SinglePassRange1 = std::vector<long unsigned int>; SinglePassRange2 = std::vector<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:213:23:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; IsoMapping = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  213 |             if (!equal(invar1_array, invar2_array))
      |                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const std::vector<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::safe_iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = int; typename std::iterator_traits< <template-parameter-1-1> >::reference = int&; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:243:54:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; IsoMapping = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  243 |             dfs_num = make_safe_iterator_property_map(
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  244 |                 dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  245 | #ifdef BOOST_NO_STD_ITERATOR_TRAITS
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                   
  246 |                 ,
      |                 ~                                     
  247 |                 dfs_num_vec.front()
      |                 ~~~~~~~~~~~~~~~~~~~                   
  248 | #endif /* BOOST_NO_STD_ITERATOR_TRAITS */
      | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             
  249 |             );
      |             ~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:281:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:281:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:321:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:321:9:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:322:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:322:9:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:355:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:355:9:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:356:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:356:9:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:373:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:373:9:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/sort.hpp:32:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:374:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:374:9:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/sort.hpp:32:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >; BinaryPredicate = boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::edge_cmp]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:255:17:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; IsoMapping = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  255 |             sort(ordered_edges, edge_cmp(G1, dfs_num));
      |             ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::~RandomAccessRangeConcept()’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::odd_components_counter<long unsigned int>, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter<long unsigned int>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::odd_components_counter<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::odd_components_counter<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::odd_components_counter<long unsigned int>; Graph = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<planar_dfs_visitor<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>&>, long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const planar_dfs_visitor<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>&>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27:   required from ‘boost::boyer_myrvold_impl<Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy>::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’
  251 |         depth_first_search(g, visitor(vis).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17:   required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list<boost::parameter::aux::flat_like_arg_tuple<boost::boyer_myrvold_params::tag::graph, boost::parameter::aux::tagged_argument_list_of_1<boost::parameter::aux::tagged_argument<boost::boyer_myrvold_params::tag::graph, const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::no_property>, boost::property<boost::edge_index_t, int, boost::no_property>, boost::no_property, boost::listS> > >, std::integral_constant<bool, true> > >; mpl_::true_ = mpl_::bool_<true>]’
   66 |                 planarity_tester(g, v_i_map);
      |                 ^~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44:   required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list<boost::parameter::aux::flat_like_arg_tuple<boost::boyer_myrvold_params::tag::graph, boost::parameter::aux::tagged_argument_list_of_1<boost::parameter::aux::tagged_argument<boost::boyer_myrvold_params::tag::graph, const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::no_property>, boost::property<boost::edge_index_t, int, boost::no_property>, boost::no_property, boost::listS> > >, std::integral_constant<bool, true> > >]’
  211 |             return dispatched_boyer_myrvold(args,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  212 |                 boost::is_same< embedding_arg_t, const no_planar_embedding& >(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  213 |                 boost::is_same< kuratowski_arg_t,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                     const no_kuratowski_subgraph_isolation& >());
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68:   required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >]’
  223 |     return boyer_myrvold_params::core::boyer_myrvold_planarity_test(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  224 |         boyer_myrvold_params::boyer_myrvold_params_t()(arg0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~       
planar.cpp:121:48:   required from here
  121 |         INTEGER(ans)[0] = boyer_myrvold_planarity_test(g);
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<planar_dfs_visitor<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>&>, long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const planar_dfs_visitor<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>&>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27:   required from ‘boost::boyer_myrvold_impl<Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy>::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’
  251 |         depth_first_search(g, visitor(vis).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17:   required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list<boost::parameter::aux::flat_like_arg_tuple<boost::boyer_myrvold_params::tag::graph, boost::parameter::aux::tagged_argument_list_of_1<boost::parameter::aux::tagged_argument<boost::boyer_myrvold_params::tag::graph, const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::no_property>, boost::property<boost::edge_index_t, int, boost::no_property>, boost::no_property, boost::listS> > >, std::integral_constant<bool, true> > >; mpl_::true_ = mpl_::bool_<true>]’
   66 |                 planarity_tester(g, v_i_map);
      |                 ^~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44:   required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list<boost::parameter::aux::flat_like_arg_tuple<boost::boyer_myrvold_params::tag::graph, boost::parameter::aux::tagged_argument_list_of_1<boost::parameter::aux::tagged_argument<boost::boyer_myrvold_params::tag::graph, const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::no_property>, boost::property<boost::edge_index_t, int, boost::no_property>, boost::no_property, boost::listS> > >, std::integral_constant<bool, true> > >]’
  211 |             return dispatched_boyer_myrvold(args,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  212 |                 boost::is_same< embedding_arg_t, const no_planar_embedding& >(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  213 |                 boost::is_same< kuratowski_arg_t,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                     const no_kuratowski_subgraph_isolation& >());
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68:   required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >]’
  223 |     return boyer_myrvold_params::core::boyer_myrvold_planarity_test(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  224 |         boyer_myrvold_params::boyer_myrvold_params_t()(arg0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~       
planar.cpp:121:48:   required from here
  121 |         INTEGER(ans)[0] = boyer_myrvold_planarity_test(g);
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; DFSVisitor = components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; DFSVisitor = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; DFSVisitor = components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; DFSVisitor = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:338:43:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<long unsigned int, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<long unsigned int, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<long unsigned int, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = long unsigned int; Y = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<char*, std::vector<char> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<char*, std::vector<char> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<char*, std::vector<char> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<char*, std::vector<char> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<char*, std::vector<char> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<char*, std::vector<char> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<char*, std::vector<char> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::vector<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<const std::vector<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<const std::vector<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<const std::vector<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const std::vector<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::isomorphism_algo<adjacency_list<vecS, vecS, undirectedS>, adjacency_list<vecS, vecS, undirectedS>, shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >, degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, vec_adj_list_vertex_id_map<no_property, long unsigned int>, unordered::unordered_flat_map<long unsigned int, long unsigned int, hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; IsoMapping = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::isomorphism_algo<adjacency_list<vecS, vecS, undirectedS>, adjacency_list<vecS, vecS, undirectedS>, shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >, degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, vec_adj_list_vertex_id_map<no_property, long unsigned int>, unordered::unordered_flat_map<long unsigned int, long unsigned int, hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; IsoMapping = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::isomorphism_algo<adjacency_list<vecS, vecS, undirectedS>, adjacency_list<vecS, vecS, undirectedS>, shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >, degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, vec_adj_list_vertex_id_map<no_property, long unsigned int>, unordered::unordered_flat_map<long unsigned int, long unsigned int, hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; IsoMapping = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  238 |                     depth_first_visit(G1, *u, dfs_visitor, color_map);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<int*, std::vector<int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<int*, std::vector<int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<int*, std::vector<int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<int*, std::vector<int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<int*, std::vector<int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<int*, std::vector<int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<int*, std::vector<int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_concepts.hpp:114:7:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_concepts.hpp:114:7:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = boost::iterators::incrementable_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:152:13:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:152:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = boost::iterators::single_pass_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:278:9:   required from ‘struct boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/equal.hpp:174:13:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/equal.hpp:174:13:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/algorithm/equal.hpp:174:13:   required from ‘typename boost::range_difference<const SinglePassRange>::type boost::range::count_if(const SinglePassRange&, UnaryPredicate) [with SinglePassRange = std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >; UnaryPredicate = boost::indirect_pmap<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<char*, std::vector<char> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, char, char&> >; typename boost::range_difference<const SinglePassRange>::type = long int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:333:51:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::match(edge_iter, int) [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; IsoMapping = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; edge_iter = std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >::iterator]’
  333 |                         num_edges_on_k -= count_if(adjacent_vertices(f[vk], G2),
      |                                           ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  334 |                             make_indirect_pmap(in_S));
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:258:26:   required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; IsoMapping = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’
  258 |             return this->match(ordered_edges.begin(), dfs_num_k);
      |                    ~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:605:33:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
  605 |     return algo.test_isomorphism();
      |            ~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::odd_components_counter<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::odd_components_counter<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::odd_components_counter<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::odd_components_counter<long unsigned int>; Graph = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::detail::odd_components_counter<long unsigned int>, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::odd_components_counter<long unsigned int>, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::odd_components_counter<long unsigned int>, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::odd_components_counter<long unsigned int>, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter<long unsigned int>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter<long unsigned int>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::odd_components_counter<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::odd_components_counter<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter<long unsigned int>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter<long unsigned int>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::odd_components_counter<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::odd_components_counter<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<planar_dfs_visitor<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>&>, long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const planar_dfs_visitor<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>, detail::edge_desc_impl<undirected_tag, long unsigned int>&>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27:   required from ‘boost::boyer_myrvold_impl<Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy>::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’
  251 |         depth_first_search(g, visitor(vis).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17:   required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list<boost::parameter::aux::flat_like_arg_tuple<boost::boyer_myrvold_params::tag::graph, boost::parameter::aux::tagged_argument_list_of_1<boost::parameter::aux::tagged_argument<boost::boyer_myrvold_params::tag::graph, const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::no_property>, boost::property<boost::edge_index_t, int, boost::no_property>, boost::no_property, boost::listS> > >, std::integral_constant<bool, true> > >; mpl_::true_ = mpl_::bool_<true>]’
   66 |                 planarity_tester(g, v_i_map);
      |                 ^~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44:   required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list<boost::parameter::aux::flat_like_arg_tuple<boost::boyer_myrvold_params::tag::graph, boost::parameter::aux::tagged_argument_list_of_1<boost::parameter::aux::tagged_argument<boost::boyer_myrvold_params::tag::graph, const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::no_property>, boost::property<boost::edge_index_t, int, boost::no_property>, boost::no_property, boost::listS> > >, std::integral_constant<bool, true> > >]’
  211 |             return dispatched_boyer_myrvold(args,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  212 |                 boost::is_same< embedding_arg_t, const no_planar_embedding& >(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  213 |                 boost::is_same< kuratowski_arg_t,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                     const no_kuratowski_subgraph_isolation& >());
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68:   required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >]’
  223 |     return boyer_myrvold_params::core::boyer_myrvold_planarity_test(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  224 |         boyer_myrvold_params::boyer_myrvold_params_t()(arg0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~       
planar.cpp:121:48:   required from here
  121 |         INTEGER(ans)[0] = boyer_myrvold_planarity_test(g);
      |                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::planar_dfs_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>&>, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:562:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:563:5:   required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, vecS, undirectedS>; Graph2 = adjacency_list<vecS, vecS, undirectedS>; IsoMapping = shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >; IndexMap1 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMap2 = vec_adj_list_vertex_id_map<no_property, long unsigned int>; std::size_t = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::incrementable_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = boost::iterators::incrementable_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, boost::iterators::single_pass_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = boost::iterators::single_pass_traversal_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const std::pair<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int>, boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::odd_components_counter<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::odd_components_counter<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::odd_components_counter<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::odd_components_counter<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; DFSVisitor = detail::biconnected_components_visitor<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, dfs_visitor<> >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::biconnected_components_visitor<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, dfs_visitor<> >, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::biconnected_components_visitor<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, dfs_visitor<> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:211:27:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::isomorphism_algo<adjacency_list<vecS, vecS, undirectedS>, adjacency_list<vecS, vecS, undirectedS>, shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >, degree_vertex_invariant<shared_array_property_map<long unsigned int, vec_adj_list_vertex_id_map<no_property, long unsigned int> >, adjacency_list<vecS, vecS, undirectedS> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, vec_adj_list_vertex_id_map<no_property, long unsigned int>, unordered::unordered_flat_map<long unsigned int, long unsigned int, hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = safe_iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:238:38:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter<long unsigned int>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter<long unsigned int>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  295 |             return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  296 |                 index_map, dtm,
      |                 ~~~~~~~~~~~~~~~                             
  297 |                 make_iterator_property_map(lowpt.begin(), index_map, vst),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  298 |                 params, get_param(params, vertex_predecessor));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60:   required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
  336 |             return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  337 |                 index_map,
      |                 ~~~~~~~~~~                                  
  338 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~                 
  339 |                     discover_time.begin(), index_map, vst),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  340 |                 params, get_param(params, vertex_lowpoint));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
  368 |     return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  369 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  370 |         params, get_param(params, vertex_discover_time));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34:   required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
  377 |     return biconnected_components(
      |            ~~~~~~~~~~~~~~~~~~~~~~^
  378 |         g, comp, out, bgl_named_params< int, buffer_param_t >(0));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_biconnected_planar.hpp:44:27:   required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*; EdgeIndexMap = adj_list_edge_property_map<undirected_tag, int, int&, long unsigned int, property<edge_index_t, int>, edge_index_t>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   44 |     biconnected_components(
      |     ~~~~~~~~~~~~~~~~~~~~~~^
   45 |         g, component_map, std::back_inserter(articulation_points));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:213:35:   required from here
  213 |            make_biconnected_planar(g, &embedding_storage[0],
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
  214 |                         get(edge_index, g), e1_vis);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_index_t, int>, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, boost::dfs_visitor<> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = isomorphism_algo<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter<long unsigned int>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; P = detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ComponentMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>, long unsigned int, long unsigned int&>; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
  106 |     depth_first_search(g, visitor(vis));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/make_connected.hpp:38:51:   required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >, long unsigned int>]’
   38 |     v_size_t num_components = connected_components(g, component);
      |                               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
planar.cpp:211:26:   required from here
  211 |            make_connected(g, get(vertex_index, g), e1_vis);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:723:42:   required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
  723 |                 return boost::isomorphism(g1, g2,
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~
  724 |                     choose_param(
      |                     ~~~~~~~~~~~~~         
  725 |                         arg_pack[_isomorphism_map | boost::param_not_found()],
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  726 |                         make_shared_array_property_map(
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  727 |                             num_vertices(g1), vertex2_t(), index1_map)),
      |                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  728 |                     invariant1, invariant2,
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
  729 |                     0,
      |                     ~~                    
  730 |                     index1_map, index2_map);
      |                     ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:734:5:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/isomorphism.hpp:738:1:   required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; Param1 = adjacency_list<vecS, vecS, undirectedS>; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const parameter::aux::empty_arg_list&)>::type = bool]’
  747 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  748 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  749 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’
  278 |         return boost::isomorphism(K_5, contracted_graph);
      |                ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34:   required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; ForwardIterator = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<undirected_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
  290 |     return is_kuratowski_subgraph(g, begin, end, get(vertex_index, g));
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
planar.cpp:435:37:   required from here
  435 |            if (is_kuratowski_subgraph(g, kuratowski_edges.begin(), kuratowski_edges.end()))
      |                ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<R_adjacency_list<undirectedS, int>, keep_all, maximum_cardinality_matching_verifier<R_adjacency_list<undirectedS, int>, long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, graph_visitor_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:779:27:   required from ‘static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<boost::undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  779 |         depth_first_search(fg, visitor(occ).vertex_index_map(vm));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:807:79:   required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]’
  807 |     return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  808 |         g, mate, vm);
      |         ~~~~~~~~~~~~                                                           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:817:48:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  815 |     return matching< Graph, MateMap, VertexIndexMap,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  816 |         edmonds_augmenting_path_finder, extra_greedy_matching,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  817 |         maximum_cardinality_matching_verifier >(g, mate, vm);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/max_cardinality_matching.hpp:824:56:   required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list<undirectedS, int>; MateMap = long unsigned int*]’
  824 |     return checked_edmonds_maximum_cardinality_matching(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  825 |         g, mate, get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
planar.cpp:686:60:   required from here
  686 |         bool is_max = checked_edmonds_maximum_cardinality_matching(g, &mate[0]);
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> >, boost::filtered_graph<R_adjacency_list<boost::undirectedS, int>, boost::keep_all, boost::maximum_cardinality_matching_verifier<R_adjacency_list<boost::undirectedS, int>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, int, boost::no_property> > >, boost::property<boost::edge_weight_t, int, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/string:48,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/locale_classes.h:40,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/ios_base.h:41,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/ios:44,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/ostream:40,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/iostream:41,
                 from RBGL.hpp:7:
In member function ‘__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector<long unsigned int>]’,
    inlined from ‘R boost::iterator_property_map<RandomAccessIterator, IndexMap, T, R>::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; T = long unsigned int; R = long unsigned int&]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:341:59,
    inlined from ‘void boost::chrobak_payne_straight_line_drawing(const Graph&, PlanarEmbedding, ForwardIterator, ForwardIterator, GridPositionMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >; ForwardIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; GridPositionMap = iterator_property_map<__gnu_cxx::__normal_iterator<coord_t*, std::vector<coord_t> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/chrobak_payne_drawing.hpp:215:18:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_iterator.h:1139:45: warning: ‘next_to_rightmost’ may be used uninitialized [-Wmaybe-uninitialized]
 1139 |       { return __normal_iterator(_M_current + __n); }
      |                                  ~~~~~~~~~~~^~~~~
In file included from planar.cpp:6:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/chrobak_payne_drawing.hpp: In function ‘void boost::chrobak_payne_straight_line_drawing(const Graph&, PlanarEmbedding, ForwardIterator, ForwardIterator, GridPositionMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>, property<edge_index_t, int> >; PlanarEmbedding = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >; ForwardIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; GridPositionMap = iterator_property_map<__gnu_cxx::__normal_iterator<coord_t*, std::vector<coord_t> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int> >; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/chrobak_payne_drawing.hpp:208:22: note: ‘next_to_rightmost’ was declared here
  208 |             vertex_t next_to_rightmost;
      |                      ^~~~~~~~~~~~~~~~~
In member function ‘__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector<long unsigned int>]’,
    inlined from ‘R boost::iterator_property_map<RandomAccessIterator, IndexMap, T, R>::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; T = long unsigned int; R = long unsigned int&]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:341:59,
    inlined from ‘void boost::boyer_myrvold_impl<Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy>::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >; EdgeIndexMap = boost::adj_list_edge_property_map<boost::undirected_tag, int, const int&, long unsigned int, const boost::property<boost::edge_index_t, int>, boost::edge_index_t>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1162:52:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_iterator.h:1139:45: warning: ‘previous_vertex’ may be used uninitialized [-Wmaybe-uninitialized]
 1139 |       { return __normal_iterator(_M_current + __n); }
      |                                  ~~~~~~~~~~~^~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp: In member function ‘void boost::boyer_myrvold_impl<Graph, VertexIndexMap, StoreOldHandlesPolicy, StoreEmbeddingPolicy>::extract_kuratowski_subgraph(OutputIterator, EdgeIndexMap) [with OutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >; EdgeIndexMap = boost::adj_list_edge_property_map<boost::undirected_tag, int, const int&, long unsigned int, const boost::property<boost::edge_index_t, int>, boost::edge_index_t>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int>, boost::property<boost::edge_index_t, int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int>, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::store_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1153:18: note: ‘previous_vertex’ was declared here
 1153 |         vertex_t previous_vertex;
      |                  ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1264:9: warning: ‘bicomp_root’ may be used uninitialized [-Wmaybe-uninitialized]
 1264 |         if (bicomp_root != v)
      |         ^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:1111:18: note: ‘bicomp_root’ was declared here
 1111 |         vertex_t bicomp_root;
      |                  ^~~~~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c registerSigHandlers.cpp -o registerSigHandlers.o
In file included from registerSigHandlers.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c shortestPath.cpp -o shortestPath.o
In file included from shortestPath.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
shortestPath.cpp: In function ‘SEXPREC* BGL_dijkstra_shortest_paths_D(SEXP, SEXP, SEXP, SEXP, SEXP)’:
shortestPath.cpp:17:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
   17 |         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
      |                                                            ^~~~
shortestPath.cpp: In function ‘SEXPREC* BGL_dag_shortest_paths(SEXP, SEXP, SEXP, SEXP, SEXP)’:
shortestPath.cpp:136:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
  136 |         typedef graph_traits < Graph_dd >::edge_descriptor Edge;
      |                                                            ^~~~
shortestPath.cpp: In function ‘SEXPREC* BGL_floyd_warshall_all_pairs_shortest_paths_D(SEXP, SEXP, SEXP, SEXP)’:
shortestPath.cpp:177:81: warning: typedef ‘Graph’ locally defined but not used [-Wunused-local-typedefs]
  177 |         property< edge_weight_t, double, property< edge_weight2_t, double > > > Graph;
      |                                                                                 ^~~~~
shortestPath.cpp:180:39: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
  180 |         typedef std::pair < int, int >Edge;
      |                                       ^~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
                 from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::BasicMatrix<Basic2DMatrix<double>, long unsigned int, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:516:5:   required from ‘struct boost::concepts::BasicMatrix<Basic2DMatrix<double>, long unsigned int, double>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:514:1:   required from ‘struct boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>’
  514 | BOOST_concept(BasicMatrix, (M)(I)(V))
      |               ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::BasicMatrix<Basic2DMatrix<double>, long unsigned int, double>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:514:15: note: in a call to non-static member function ‘boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>::~BasicMatrixConcept()’
  514 | BOOST_concept(BasicMatrix, (M)(I)(V))
      |               ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:514:1: note: in expansion of macro ‘BOOST_concept’
  514 | BOOST_concept(BasicMatrix, (M)(I)(V))
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >::~VertexListGraphConcept()’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >::~EdgeListGraphConcept()’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::BasicMatrix<Basic2DMatrix<double>, long unsigned int, double>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::BasicMatrix<Basic2DMatrix<double>, long unsigned int, double> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:516:5:   required from ‘struct boost::concepts::BasicMatrix<Basic2DMatrix<double>, long unsigned int, double>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:514:1:   required from ‘struct boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>’
  514 | BOOST_concept(BasicMatrix, (M)(I)(V))
      |               ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BasicMatrix<M, I, V>::~BasicMatrix() [with M = Basic2DMatrix<double>; I = long unsigned int; V = double]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:516:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  516 |     BOOST_CONCEPT_USAGE(BasicMatrix)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >::~EdgeListGraphConcept()’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >::~EdgeListGraphConcept()’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<double*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = double*; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:120:43:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<double*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = double*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<double*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<double*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<double*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<double*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = double*; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<double*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = double*; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<double*, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<double*, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<double*, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<double*, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = double*; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
  107 |   template <> struct SignedInteger<long> {};
      |                      ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >, R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:16,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:13,
                 from shortestPath.cpp:5:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; Graph = R_adjacency_list<boost::directedS, double>]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept<boost::default_color_type>::~ColorValueConcept()’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’
  502 | BOOST_concept(ColorValue, (C))
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:39:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; Graph = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >, R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >, R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >, R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue<C>::~ColorValue() [with C = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  505 |     BOOST_CONCEPT_USAGE(ColorValue)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35:   required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  417 |     detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:42:22:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, default_color_type, default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   42 |     depth_first_visit(g, s, topo_visitor, color);
      |     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:90:27:   required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   90 |         dag_shortest_paths(g, s, distance, weight, color,
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             choose_param(get_param(params, vertex_predecessor), p_map), vis,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   92 |             choose_param(
      |             ~~~~~~~~~~~~~  
   93 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   94 |             choose_param(
      |             ~~~~~~~~~~~~~  
   95 |                 get_param(params, distance_combine_t()), closed_plus< D >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   96 |             inf, choose_param(get_param(params, distance_zero_t()), D()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:114:25:   required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  114 |         dag_sp_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~^~~~~~
  115 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~
  116 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  117 |                     distance_map.begin(), id, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |             weight,
      |             ~~~~~~~      
  119 |             choose_param(color,
      |             ~~~~~~~~~~~~~~~~~~~
  120 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  121 |                     color_map.begin(), id, color_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  122 |             id, vis, params);
      |             ~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dag_shortest_paths.hpp:134:29:   required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  134 |     detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  135 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  136 |         get_param(params, vertex_color),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  137 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |         choose_param(
      |         ~~~~~~~~~~~~~        
  139 |             get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  140 |         params);
      |         ~~~~~~~              
shortestPath.cpp:144:27:   required from here
  144 |         dag_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  145 |                            predecessor_map(&p[0]).distance_map(&d[0]));
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >, R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21,
                 from shortestPath.cpp:3:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; Graph = R_adjacency_list<boost::directedS, double>]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43:   required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  176 |         return bellman_ford_shortest_paths(g, N, weight, pred, distance,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  177 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  178 |                 get_param(params, distance_combine_t()), closed_plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  179 |             choose_param(
      |             ~~~~~~~~~~~~~                  
  180 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  181 |             choose_param(get_param(params, graph_visitor), null_vis));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41:   required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params<P, T, R>&) [with EdgeListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> >; Size = int; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’
  190 |         return detail::bellman_dispatch2(g, get_param(params, root_vertex_t()),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  191 |             N, weight,
      |             ~~~~~~~~~~                   
  192 |             choose_param(get_param(params, vertex_predecessor), dummy_pred),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  193 |             distance, params);
      |             ~~~~~~~~~~~~~~~~~            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const bgl_named_params<P, T, R>&) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, double, no_property> >; Size = int; P = double*; T = vertex_distance_t; R = bgl_named_params<long unsigned int*, vertex_predecessor_t, bgl_named_params<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, no_property> >]’
  201 |     return detail::bellman_dispatch(g, N,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  202 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  203 |         choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  204 |         params);
      |         ~~~~~~~                     
shortestPath.cpp:105:45:   required from here
  105 |         bool r = bellman_ford_shortest_paths(g, N,
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  106 |                  weight_map(w).predecessor_map(&p[0]).distance_map(&d[0]));
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_weight_t, double, boost::no_property> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:39:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; Graph = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >, R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >, R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >, R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >, R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:39:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; Zero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55:   required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params<P, T, R>&) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’
  172 |         return floyd_warshall_all_pairs_shortest_paths(g, d, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
  173 |             choose_param(
      |             ~~~~~~~~~~~~~                              
  174 |                 get_param(params, distance_compare_t()), std::less< WM >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  175 |             choose_param(get_param(params, distance_combine_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  176 |                 closed_plus< WM >(inf)),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~               
  177 |             inf, choose_param(get_param(params, distance_zero_t()), WM()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51:   required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  217 |     return detail::floyd_warshall_noninit_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  218 |         g, d, get(edge_weight, g), params);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~         
shortestPath.cpp:186:48:   required from here
  186 |         floyd_warshall_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46:   required from ‘static boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::type boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = R_adjacency_list<boost::directedS, double>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>]’
  245 |             return make_iterator_property_map(array_holder.get(), index);
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33:   required from ‘static boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::type boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = R_adjacency_list<boost::directedS, double>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>]’
  273 |             return helper::build(g, index, array_holder);
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
  377 |         = IndexInHeapMapHelper::build(g, index_map, index_in_heap_map_holder);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<long unsigned int*>::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<directedS, double>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = double*; Tag = vertex_distance_t; Base = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  434 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  435 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; Param = double*; Tag = vertex_distance_t; Rest = bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
shortestPath.cpp:25:32:   required from here
   25 |         dijkstra_shortest_paths(g, vertex((int)INTEGER(init_ind)[0], g),
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   26 |                                 predecessor_map(&p[0]).distance_map(&d[0]));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> >, boost::no_property, boost::listS> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::directedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<directedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shortestPath.cpp:56:41:   required from here
   56 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c sna.cpp -o sna.o
In file included from sna.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
sna.cpp: In function ‘SEXPREC* lambdaSets(SEXP, SEXP, SEXP, SEXP)’:
sna.cpp:161:9: warning: variable ‘res_cap’ set but not used [-Wunused-but-set-variable]
  161 |         res_cap = get(edge_residual_capacity, flow_g);
      |         ^~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::BasicMatrix<Basic2DMatrix<double>, long unsigned int, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:516:5:   required from ‘struct boost::concepts::BasicMatrix<Basic2DMatrix<double>, long unsigned int, double>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:514:1:   required from ‘struct boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>’
  514 | BOOST_concept(BasicMatrix, (M)(I)(V))
      |               ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::BasicMatrix<Basic2DMatrix<double>, long unsigned int, double>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
                 from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:514:15: note: in a call to non-static member function ‘boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>::~BasicMatrixConcept()’
  514 | BOOST_concept(BasicMatrix, (M)(I)(V))
      |               ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:514:1: note: in expansion of macro ‘BOOST_concept’
  514 | BOOST_concept(BasicMatrix, (M)(I)(V))
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::BasicMatrix<Basic2DMatrix<double>, long unsigned int, double>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::BasicMatrix<Basic2DMatrix<double>, long unsigned int, double> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:516:5:   required from ‘struct boost::concepts::BasicMatrix<Basic2DMatrix<double>, long unsigned int, double>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:514:1:   required from ‘struct boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>’
  514 | BOOST_concept(BasicMatrix, (M)(I)(V))
      |               ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BasicMatrixConcept<Basic2DMatrix<double>, long unsigned int, double>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BasicMatrix<M, I, V>::~BasicMatrix() [with M = Basic2DMatrix<double>; I = long unsigned int; V = double]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:516:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  516 |     BOOST_CONCEPT_USAGE(BasicMatrix)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >::~EdgeListGraphConcept()’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~          
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
  107 |   template <> struct SignedInteger<long> {};
      |                      ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:29,
                 from sna.cpp:3:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:40:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:40:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>]’
  136 |     breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25:   required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  147 |     breadth_first_search(g, sources, sources + 1, Q, vis, color);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>, boost::on_tree_edge> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5:   required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Size = long unsigned int; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight_t>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; BinaryFunction = closed_plus<double>; BinaryPredicate = std::less<double>; BellmanFordVisitor = bellman_visitor<>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  112 |     if (bellman_ford_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  113 |             g2, num_vertices(g2), w, pred, d, combine, compare, bvis))
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46:   required from ‘static boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::type boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>]’
  245 |             return make_iterator_property_map(array_holder.get(), index);
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33:   required from ‘static boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::type boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>]’
  273 |             return helper::build(g, index, array_holder);
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  377 |         = IndexInHeapMapHelper::build(g, index_map, index_in_heap_map_holder);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<long unsigned int*>::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus<double>, std::less<double> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_distance_t, double, boost::no_property>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>, long unsigned int, long unsigned int&>, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>, dummy_property_map, vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>, closed_plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_distance_t, double, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, double, boost::no_property> >, boost::no_property, boost::listS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  101 |         breadth_first_search(detail::residual_graph(g, res), src, Q,
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  102 |             make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  103 |             color);
      |             ~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  154 |             return edmonds_karp_max_flow(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  155 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  156 |                     get_param(params, edge_capacity), g, edge_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  157 |                 choose_pmap(get_param(params, edge_residual_capacity), g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  158 |                     edge_residual_capacity),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~
  159 |                 choose_const_pmap(
      |                 ~~~~~~~~~~~~~~~~~~       
  160 |                     get_param(params, edge_reverse), g, edge_reverse),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  161 |                 make_iterator_property_map(color_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  162 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~   
  163 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     color_vec[0]),
      |                     ~~~~~~~~~~~~~~       
  165 |                 pred);
      |                 ~~~~~                    
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54:   required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  208 |             return edmonds_karp_dispatch2< C >::apply(g, src, sink,
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  209 |                 make_iterator_property_map(pred_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  210 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~                
  211 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  212 |                     pred_vec[0]),
      |                     ~~~~~~~~~~~~~                     
  213 |                 params, get_param(params, vertex_color));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57:   required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  228 |     return detail::edmonds_karp_dispatch1< Pred >::apply(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  229 |         g, src, sink, params, get_param(params, vertex_predecessor));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33:   required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  240 |     return edmonds_karp_max_flow(g, src, sink, params);
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sna.cpp:204:54:   required from here
  204 |                 CC[i][j] = (int)edmonds_karp_max_flow(flow_g, s, t);
      |                                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double]’
  491 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  492 |         index_map, compare, combine, inf, zero, vis, no_named_parameters());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = dummy_property_map; DistanceMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>, adjacency_list<vecS, vecS, directedS, property<vertex_distance_t, double, no_property>, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, no_property, listS>*, double, double&, vertex_distance_t>; WeightMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_weight2_t, double, no_property> >, edge_weight2_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_distance_t, double, no_property>, long unsigned int>; Compare = std::less<double>; Combine = closed_plus<double>; DistInf = double; DistZero = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  505 |     dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  506 |         index_map, compare, combine, inf, zero, vis);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; VertexID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Weight = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; BinaryPredicate = std::less<double>; BinaryFunction = closed_plus<double>; Infinity = double; DistanceZero = double]’
  127 |             dijkstra_shortest_paths(
      |             ~~~~~~~~~~~~~~~~~~~~~~~^
  128 |                 g2, *u, pred, d, w_hat, id2, compare, combine, inf, zero, dvis);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48:   required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params<P, T, R>&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>]’
  164 |         return johnson_all_pairs_shortest_paths(g, D, id, w,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
  165 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  166 |                 get_param(params, distance_compare_t()), std::less< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             choose_param(
      |             ~~~~~~~~~~~~~                       
  168 |                 get_param(params, distance_combine_t()), closed_plus< WT >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |             choose_param(get_param(params, distance_inf_t()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  170 |                 std::numeric_limits< WT >::max
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
  171 |                     BOOST_PREVENT_MACRO_SUBSTITUTION()),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  172 |             choose_param(get_param(params, distance_zero_t()), WT()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36:   required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list<undirectedS, double>; DistanceMatrix = Basic2DMatrix<double>]’
  192 |     return detail::johnson_dispatch(
      |            ~~~~~~~~~~~~~~~~~~~~~~~~^
  193 |         g, D, params, get(edge_weight, g), get(vertex_index, g));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sna.cpp:105:41:   required from here
  105 |         johnson_all_pairs_shortest_paths(g, D);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c transitive_closure.cpp -o transitive_closure.o
In file included from transitive_closure.cpp:17:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/bind/mem_fn.hpp:23,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/bind/bind.hpp:23,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:16,
                 from transitive_closure.cpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/config/no_tr1/memory.hpp:21,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/get_pointer.hpp:14:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/aux_/na_assert.hpp:23,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/arg.hpp:25,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/placeholders.hpp:24,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_categories.hpp:16,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_traits.hpp:25,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:18:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:21:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/int.hpp:20,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/lambda_fwd.hpp:23,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/aux_/na_spec.hpp:18,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/if.hpp:19,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_traits.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >::~VertexListGraphConcept()’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::AdjacencyGraph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:157:5:   required from ‘struct boost::concepts::AdjacencyGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘struct boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::AdjacencyGraph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:15: note: in a call to non-static member function ‘boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >::~AdjacencyGraphConcept()’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1: note: in expansion of macro ‘BOOST_concept’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexMutableGraph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:295:5:   required from ‘struct boost::concepts::VertexMutableGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:292:1:   required from ‘struct boost::concepts::VertexMutableGraphConcept<R_adjacency_list<boost::directedS, double> >’
  292 | BOOST_concept(VertexMutableGraph, (G))
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexMutableGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexMutableGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexMutableGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexMutableGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:75:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexMutableGraph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexMutableGraphConcept<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:75:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:292:15: note: in a call to non-static member function ‘boost::concepts::VertexMutableGraphConcept<R_adjacency_list<boost::directedS, double> >::~VertexMutableGraphConcept()’
  292 | BOOST_concept(VertexMutableGraph, (G))
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:292:1: note: in expansion of macro ‘BOOST_concept’
  292 | BOOST_concept(VertexMutableGraph, (G))
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeMutableGraph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:279:5:   required from ‘struct boost::concepts::EdgeMutableGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:275:1:   required from ‘struct boost::concepts::EdgeMutableGraphConcept<R_adjacency_list<boost::directedS, double> >’
  275 | BOOST_concept(EdgeMutableGraph, (G))
      |               ^~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeMutableGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeMutableGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeMutableGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeMutableGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:76:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeMutableGraph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeMutableGraphConcept<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:76:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:275:15: note: in a call to non-static member function ‘boost::concepts::EdgeMutableGraphConcept<R_adjacency_list<boost::directedS, double> >::~EdgeMutableGraphConcept()’
  275 | BOOST_concept(EdgeMutableGraph, (G))
      |               ^~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:275:1: note: in expansion of macro ‘BOOST_concept’
  275 | BOOST_concept(EdgeMutableGraph, (G))
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:77:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::AdjacencyGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::AdjacencyGraph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:157:5:   required from ‘struct boost::concepts::AdjacencyGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘struct boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:157:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  157 |     BOOST_CONCEPT_USAGE(AdjacencyGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexMutableGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexMutableGraph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:295:5:   required from ‘struct boost::concepts::VertexMutableGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:292:1:   required from ‘struct boost::concepts::VertexMutableGraphConcept<R_adjacency_list<boost::directedS, double> >’
  292 | BOOST_concept(VertexMutableGraph, (G))
      |               ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexMutableGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexMutableGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexMutableGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexMutableGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:75:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexMutableGraph<G>::~VertexMutableGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:295:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  295 |     BOOST_CONCEPT_USAGE(VertexMutableGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeMutableGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeMutableGraph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:279:5:   required from ‘struct boost::concepts::EdgeMutableGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:275:1:   required from ‘struct boost::concepts::EdgeMutableGraphConcept<R_adjacency_list<boost::directedS, double> >’
  275 | BOOST_concept(EdgeMutableGraph, (G))
      |               ^~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeMutableGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeMutableGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeMutableGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeMutableGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:76:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeMutableGraph<G>::~EdgeMutableGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:279:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  279 |     BOOST_CONCEPT_USAGE(EdgeMutableGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:77:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:77:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:159:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:159:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:160:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:160:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::adjacency_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:77:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:159:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::adjacency_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:160:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::adjacency_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:159:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:159:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:159:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:159:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:159:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:159:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:159:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = shared_array_property_map<default_color_type, typed_identity_property_map<long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
  107 |   template <> struct SignedInteger<long> {};
      |                      ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:159:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:159:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:115:9:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:162:42:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  162 |             return strong_components_impl(g, comp, r_map,
      |                    ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
  163 |                 make_iterator_property_map(time_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~    
  165 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  166 |                     time_vec[0]),
      |                     ~~~~~~~~~~~~~         
  167 |                 params);
      |                 ~~~~~~~                   
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  177 |         return strong_comp_dispatch2< DiscoverTimeMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  178 |             g, comp, r_map, params, time_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:162:42:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  162 |             return strong_components_impl(g, comp, r_map,
      |                    ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
  163 |                 make_iterator_property_map(time_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~    
  165 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  166 |                     time_vec[0]),
      |                     ~~~~~~~~~~~~~         
  167 |                 params);
      |                 ~~~~~~~                   
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  177 |         return strong_comp_dispatch2< DiscoverTimeMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  178 |             g, comp, r_map, params, time_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:119:9:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:162:42:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  162 |             return strong_components_impl(g, comp, r_map,
      |                    ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
  163 |                 make_iterator_property_map(time_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  164 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~    
  165 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  166 |                     time_vec[0]),
      |                     ~~~~~~~~~~~~~         
  167 |                 params);
      |                 ~~~~~~~                   
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  177 |         return strong_comp_dispatch2< DiscoverTimeMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  178 |             g, comp, r_map, params, time_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~                  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<long unsigned int, long unsigned int>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = shared_array_property_map<default_color_type, typed_identity_property_map<long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = shared_array_property_map<default_color_type, typed_identity_property_map<long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = shared_array_property_map<default_color_type, typed_identity_property_map<long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept<boost::default_color_type>::~ColorValueConcept()’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’
  502 | BOOST_concept(ColorValue, (C))
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:73:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::adjacency_iterator<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:159:9:   required from ‘boost::concepts::AdjacencyGraph<G>::~AdjacencyGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:152:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyGraphConcept<R_adjacency_list<boost::directedS, double> >]’
  152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:74:5:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11:   required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11:   required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:115:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:115:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:115:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = long unsigned int; Y = long unsigned int]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5:   required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1:   required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
  502 | BOOST_concept(ColorValue, (C))
      |               ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue<C>::~ColorValue() [with C = boost::default_color_type]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  505 |     BOOST_CONCEPT_USAGE(ColorValue)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:206:43:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~     
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~           
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = shared_array_property_map<default_color_type, typed_identity_property_map<long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = shared_array_property_map<default_color_type, typed_identity_property_map<long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = shared_array_property_map<default_color_type, typed_identity_property_map<long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = shared_array_property_map<default_color_type, typed_identity_property_map<long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = shared_array_property_map<default_color_type, typed_identity_property_map<long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = detail::tarjan_scc_visitor<iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = detail::tarjan_scc_visitor<iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; T = graph_visitor_t; R = bgl_named_params<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::tarjan_scc_visitor<iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:129:27:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  129 |         depth_first_search(g, params.visitor(vis));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:162:42:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; Graph = R_adjacency_list<boost::directedS, double>]’
   39 |     void constraints()
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::typed_identity_property_map<long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9:   required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; Graph = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = detail::tarjan_scc_visitor<iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = detail::tarjan_scc_visitor<iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; T = graph_visitor_t; R = bgl_named_params<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::tarjan_scc_visitor<iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:129:27:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = detail::tarjan_scc_visitor<iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = R_adjacency_list<directedS, double>; P = detail::tarjan_scc_visitor<iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; T = graph_visitor_t; R = bgl_named_params<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::tarjan_scc_visitor<iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:129:27:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::typed_identity_property_map<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
  680 |         return detail::BOOST_PP_CAT(                                          \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  681 |             name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()(            \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
  682 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)     \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  683 |                 arg_pack);                                                    \
      |                 ~~~~~~~~~                                         
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:409:1:   required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS>; P = topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<typed_identity_property_map<long unsigned int>, vertex_index_t, no_property>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::vertex_index_map, const typed_identity_property_map<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
  730 |         return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)(         \
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
  731 |             BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed)      \
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  732 |                 arg_pack);                                                     \
      |                 ~~~~~~~~~                                             
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23:   required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = typed_identity_property_map<long unsigned int>; T = vertex_index_t; R = no_property]’
   69 |     depth_first_search(g, params.visitor(TopoVisitor(result)));
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:122:21:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
  122 |     topological_sort(CG, std::back_inserter(topo_order),
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  123 |         vertex_index_map(identity_property_map()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::no_property>*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::no_property>, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = detail::tarjan_scc_visitor<iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
  286 |         detail::depth_first_visit_impl(
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  287 |             g, start_vertex, vis, color, detail::nontruth2());
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42:   required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
  397 |                 boost::depth_first_search(g,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
  398 |                     arg_pack[_visitor | make_dfs_visitor(null_visitor())],
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  399 |                     boost::detail::make_color_map_from_arg_pack(g, arg_pack),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  400 |                     arg_pack[_root_vertex
      |                     ~~~~~~~~~~~~~~~~~~~~~ 
  401 |                         || boost::detail::get_default_starting_vertex_t<
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  402 |                             Graph >(g)]);
      |                             ~~~~~~~~~~~~  
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:406:5:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9:   required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = tarjan_scc_visitor<boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31:   required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  205 |             return scc_helper2(g, comp,
      |                    ~~~~~~~~~~~^~~~~~~~~
  206 |                 make_iterator_property_map(root_vec.begin(),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  207 |                     choose_const_pmap(
      |                     ~~~~~~~~~~~~~~~~~~
  208 |                         get_param(params, vertex_index), g, vertex_index),
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  209 |                     root_vec[0]),
      |                     ~~~~~~~~~~~~~
  210 |                 params, get_param(params, vertex_discover_time));
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = long unsigned int]’
  220 |         return detail::strong_comp_dispatch1< RootMap >::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  221 |             g, comp, params, r_map);
      |             ~~~~~~~~~~~~~~~~~~~~~~~                            
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31:   required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = no_property; typename property_traits<IndexMap>::value_type = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
  235 |     return detail::scc_helper1(
      |            ~~~~~~~~~~~~~~~~~~~^
  236 |         g, comp, params, get_param(params, vertex_root_t()));
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:86:28:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>; G_to_TC_VertexMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
   86 |         = strong_components(g, component_number, vertex_index_map(index_map));
      |           ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:288:23:   required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list<directedS, double>; GraphTC = R_adjacency_list<directedS, double>]’
  288 |     transitive_closure(g, tc, g_to_tc_map, index_map);
      |     ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
transitive_closure.cpp:29:24:   required from here
   29 |         transitive_closure(g, TC);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_algobase.h:67,
                 from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/vector:62,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/transitive_closure.hpp:12:
In function ‘bool __gnu_cxx::operator==(const __normal_iterator<_Iterator, _Container>&, const __normal_iterator<_Iterator, _Container>&) [with _Iterator = boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*; _Container = std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’,
    inlined from ‘bool boost::iterators::iterator_adaptor<Derived, Base, Value, Traversal, Reference, Difference>::equal(const boost::iterators::iterator_adaptor<OtherDerived, OtherIterator, V, C, R, D>&) const [with OtherDerived = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; OtherIterator = __gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >; V = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; C = boost::use_default; R = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; D = long int; Derived = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Base = __gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >; Value = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Traversal = boost::use_default; Reference = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Difference = long int]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_adaptor.hpp:305:29,
    inlined from ‘static bool boost::iterators::iterator_core_access::equal(const Facade1&, const Facade2&, mpl_::true_) [with Facade1 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Facade2 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_facade.hpp:649:26,
    inlined from ‘typename boost::iterators::detail::enable_if_interoperable<Derived1, Derived2, typename boost::mpl::apply2<boost::iterators::detail::always_bool2, Derived1, Derived2>::type>::type boost::iterators::operator!=(const iterator_facade<Derived1, V1, TC1, Reference1, Difference1>&, const iterator_facade<Derived2, V2, TC2, Reference2, Difference2>&) [with Derived1 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; V1 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; TC1 = random_access_traversal_tag; Reference1 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Difference1 = long int; Derived2 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; V2 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; TC2 = random_access_traversal_tag; Reference2 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Difference2 = long int]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_facade.hpp:982:3,
    inlined from ‘bool boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator<long unsigned int>; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/adj_list_edge_iterator.hpp:113:25,
    inlined from ‘SEXPREC* BGL_transitive_closure_D(SEXP, SEXP, SEXP)’ at transitive_closure.cpp:44:52:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_iterator.h:1219:27: warning: ‘*(boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >* const*)((char*)&e_end + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >::edges.boost::optional<std::pair<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::<unnamed>.boost::optional_detail::optional_base<std::pair<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::m_storage.boost::optional_detail::aligned_storage<std::pair<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::dummy_))’ may be used uninitialized [-Wmaybe-uninitialized]
 1219 |     { return __lhs.base() == __rhs.base(); }
      |              ~~~~~~~~~~~~~^~~~~~~~~~~~~~~
transitive_closure.cpp: In function ‘SEXPREC* BGL_transitive_closure_D(SEXP, SEXP, SEXP)’:
transitive_closure.cpp:43:37: note: ‘e_end’ declared here
   43 |         Graph_dd::edge_iterator ei, e_end;
      |                                     ^~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG  -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include    -fPIC  -g -O2  -Wall -Werror=format-security -DR_NO_REMAP -c wavefront.cpp -o wavefront.o
In file included from wavefront.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
   41 | #define R_NO_REMAP
      |         ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
                 from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
  194 | failed ************ (Pred::************
      |                     ^~~~~~~~~~~~~~~~~~~
      |                     -
  195 |       assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  196 |     );
      |     ~                
      |     -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
  199 | failed ************ (boost::mpl::not_<Pred>::************
      |                     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                     -
  200 |       assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  201 |     );
      |     ~                
      |     -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
                 from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
                 from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -shared -L/home/biocbuild/R/R/lib -L/usr/local/lib -o RBGL.so bbc.o cliques.o clusteringCoef.o dominatorTree.o edmonds_optimum_branching.o hcs.o incrConnComp.o interfaces.o minST.o mincut.o ordering.o planar.o registerSigHandlers.o shortestPath.o sna.o transitive_closure.o wavefront.o -L/home/biocbuild/R/R/lib -lR
installing to /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/00LOCK-RBGL/00new/RBGL/libs
** R
** data
** inst
** byte-compile and prepare package for lazy loading
** help
*** installing help indices
** building package indices
** installing vignettes
** testing if installed package can be loaded from temporary location
** checking absolute paths in shared objects and dynamic libraries
** testing if installed package can be loaded from final location
** testing if installed package keeps a record of temporary installation path
* DONE (RBGL)